Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
32 | Toshihiro Fujito |
On Approximability of the Independent/Connected Edge Dominating Set Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 20th Conference, FST TCS 2000 New Delhi, India, December 13-15, 2000, Proceedings., pp. 117-126, 2000, Springer, 3-540-41413-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
32 | Ran Raz, Pierre McKenzie |
Separation of the Monotone NC Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(3), pp. 403-435, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q15, 68R99, 68Q25 |
32 | Cyril Gavoille, Nicolas Hanusse |
Compact Routing Tables for Graphs of Bounded Genus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 351-360, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
32 | Gabriele Neyer |
Line Simplification with Restricted Orientations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings, pp. 13-24, 1999, Springer, 3-540-66279-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
32 | Ziv Bar-Yossef, Oded Goldreich 0001, Avi Wigderson |
Deterministic Amplification of Space-Bounded Probabilistic Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 188-, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
space bounded randomized computation, deterministic amplification, expander graphs |
32 | Ravi Kumar 0001, D. Sivakumar 0001 |
Proofs, Codes, and Polynomial-Time Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 46-53, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
reducibilities, proof systems, partial solutions |
32 | Koji Nakano, Stephan Olariu |
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 9(6), pp. 561-569, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Monotone matrices, totally monotone matrices, row minima, basic reconfigurable meshes, cellular system design, VLSI design, search problems, reconfigurable meshes, facility location problems |
32 | Sanguthevar Rajasekaran, Insup Lee 0001 |
Parallel Algorithms for Relational Coarsest Partition Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 9(7), pp. 687-699, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Bisimulation checking, coarsest partition problems, analysis of concurrent systems, parallel algorithms, labeled transition systems |
32 | Walter Unger |
The Complexity of the Approximation of the Bandwidth Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 82-91, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
comlexity, approximation, bandwidth |
32 | Sameer A. Nene, Shree K. Nayar |
Closest Point Search in High Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96), June 18-20, 1996 San Francisco, CA, USA, pp. 859-865, 1996, IEEE Computer Society, 0-8186-7258-7. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
projection search, searching by slicing, object recognition, benchmarks, Pattern classification, nearest neighbor, closest point |
32 | Uriel Feige, Joe Kilian |
Zero Knowledge and the Chromatic Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 278-287, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
approximation algorithms, zero knowledge, chromatic number, probabilistically checkable proofs |
32 | Kwan Woo Ryu, Joseph F. JáJá |
Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 1(1), pp. 83-90, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
linear speedup, basic graph problems, tree expression evaluation, st-numbering, one-port communication, parallel algorithms, computational complexity, load balancing, graph theory, sorting, sorting, graph algorithms, biconnected components, list ranking, graph problems, hypercube algorithm, hypercube algorithms, ear decomposition |
31 | Piya Tanthawichian, Akihiro Fujii, Yoshiaki Nemoto |
Bandwidth Allocation in ATM Networks: Heuristic Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCN ![In: Proceedings of the International Conference On Computer Communications and Networks (ICCCN 1998), October 12-15, 1998, Lafayette, Louisiana, USA, pp. 20-25, 1998, IEEE Computer Society, 0-8186-9014-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
CAC $epsilon$-quantile function, Bandwidth Allocation, Heuristic Approach |
31 | David Fernández-Baca |
Allocating Modules to Processors in a Distributed System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(11), pp. 1427-1436, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
execution costs, P=NP, polynomial-time epsilon -approximate algorithm, optimum assignment, almost-tree, module allocation problem, distributed system, computational complexity, complexity, graph theory, distributed processing, iteration, polynomial time, planar, bipartite, partial k-tree, local search algorithm, communication graph |
30 | Michael Gimelfarb, Scott Sanner, Chi-Guhn Lee |
Epsilon-BMC: A Bayesian Ensemble Approach to Epsilon-Greedy Exploration in Model-Free Reinforcement Learning. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
UAI ![In: Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, UAI 2019, Tel Aviv, Israel, July 22-25, 2019, pp. 476-485, 2019, AUAI Press. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
30 | Andreas Wiese |
Independent Set of Convex Polygons: From $$n^{\epsilon }$$ n ϵ to $$1+\epsilon $$ 1 + ϵ via Shrinking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 80(3), pp. 918-934, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
30 | Dong Quan Vu, Patrick Loiseau, Alonso Silva |
A Simple and Efficient Algorithm to Compute Epsilon-Equilibria of Discrete Colonel Blotto Games: Epsilon-Equilibria of Discrete Colonel Blotto Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018, Stockholm, Sweden, July 10-15, 2018, pp. 2115-2117, 2018, International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
30 | Jeffrey L. Popyack, Orlando S. Madrigal |
UPSILON PI EPSILON: Upsilon Pi Epsilon's half century. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inroads ![In: Inroads 8(2), pp. 17-19, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
30 | Nabil H. Mustafa, Kasturi R. Varadarajan |
Epsilon-approximations and epsilon-nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1702.03676, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
30 | El Makki Voundy |
Langages epsilon-sûrs et caractérisations des langages d'ordres supérieurs. (Epsilon-safe languages and characterizations of higher order languages). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2017 |
RDF |
|
30 | David Felber, Rafail Ostrovsky |
A Randomized Online Quantile Summary in O(1/epsilon * log(1/epsilon)) Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 775-785, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
30 | Nabil H. Mustafa, Saurabh Ray |
Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Geom. ![In: Comput. Geom. 43(6-7), pp. 565-571, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
30 | Xueling Ma, Jianming Zhan 0001, Bijan Davvaz, Young Bae Jun |
Some kinds of (epsilon, epsilon or q)-interval-valued fuzzy ideals of BCI-algebras ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 178(19), pp. 3738-3754, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Nabil H. Mustafa, Saurabh Ray |
Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Geom. ![In: Comput. Geom. 40(1), pp. 84-91, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Muhammad Akram |
(epsilon, epsilon ^ q)-Fuzzy ideals of K-algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 89, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
30 | Min Zhang 0010, Wenjian Luo, Xingxin Pei, Xufa Wang |
The self-adaption strategy for parameter epsilon in epsilon-MOEA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2008, June 1-6, 2008, Hong Kong, China, pp. 2940-2947, 2008, IEEE, 978-1-4244-1822-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Bijan Davvaz |
(epsilon, epsilon v q)-fuzzy subnear-rings and ideals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 10(3), pp. 206-211, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 16Y30, 03E72, 16Y99 |
30 | Tetsuyuki Takahama, Setsuko Sakai |
Constrained Optimization by epsilon Constrained Particle Swarm Optimizer with epsilon-level Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSTST ![In: Soft Computing as Transdisciplinary Science and Technology, Proceedings of the fourth IEEE International Workshop, WSTST'05, Muroran, Japan, pp. 1019-1029, 2005, Springer, 978-3-540-25055-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Alexander Kovalenkov, Myrna Holtz Wooders |
An Exact Bound on Epsilon for Nonemptiness of Epsilon Cores of Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 26(4), pp. 654-678, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
30 | James T. Kwok |
Linear Dependency between epsilon and the Input Noise in epsilon-Support Vector Regression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICANN ![In: Artificial Neural Networks - ICANN 2001, International Conference Vienna, Austria, August 21-25, 2001 Proceedings, pp. 405-410, 2001, Springer, 3-540-42486-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
30 | Stefan Sujan |
Epsilon-rates, epsilon-quantiles, and group coding theorems for finitely additive information sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Kybernetika ![In: Kybernetika 16(2), pp. 105-119, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP BibTeX RDF |
|
25 | Jennifer M. Davoren |
Epsilon-Tubes and Generalized Skorokhod Metrics for Hybrid Paths Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 12th International Conference, HSCC 2009, San Francisco, CA, USA, April 13-15, 2009. Proceedings, pp. 135-149, 2009, Springer, 978-3-642-00601-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Carlos Alzate, Johan A. K. Suykens |
Kernel Component Analysis Using an Epsilon-Insensitive Robust Loss Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Neural Networks ![In: IEEE Trans. Neural Networks 19(9), pp. 1583-1598, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Ramesh Raskar |
Computational Photography: Epsilon to Coded Photography. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ETVC ![In: Emerging Trends in Visual Computing, LIX Fall Colloquium, ETVC 2008, Palaiseau, France, November 18-20, 2008. Revised Invited Papers, pp. 238-253, 2008, Springer, 978-3-642-00825-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Fourier optics, Optical heterodyning, Coded aperture imaging, digital refocusing, plenoptic camera, Fourier transform, Digital photography |
25 | Xilong Che, Liang Hu 0001 |
Parallel Multidimensional Step search algorithm for epsilon-insensitive support vector regression in time series prediction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCNN ![In: Proceedings of the International Joint Conference on Neural Networks, IJCNN 2008, part of the IEEE World Congress on Computational Intelligence, WCCI 2008, Hong Kong, China, June 1-6, 2008, pp. 595-601, 2008, IEEE, 978-1-4244-1820-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Louis M. Rose, Richard F. Paige, Dimitrios S. Kolovos, Fiona Polack |
The Epsilon Generation Language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECMDA-FA ![In: Model Driven Architecture - Foundations and Applications, 4th European Conference, ECMDA-FA 2008, Berlin, Germany, June 9-13, 2008. Proceedings, pp. 1-16, 2008, Springer, 978-3-540-69095-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Dimitrios S. Kolovos, Richard F. Paige, Fiona Polack |
Merging Models with the Epsilon Merging Language (EML). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MoDELS ![In: Model Driven Engineering Languages and Systems, 9th International Conference, MoDELS 2006, Genova, Italy, October 1-6, 2006, Proceedings, pp. 215-229, 2006, Springer, 3-540-45772-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Dimitrios S. Kolovos, Richard F. Paige, Fiona Polack |
The Epsilon Object Language (EOL). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECMDA-FA ![In: Model Driven Architecture - Foundations and Applications, 2nd European Conference, ECMDA-FA 2006, Bilbao, Spain, July 10-13, 2006, Proceedings, pp. 128-142, 2006, Springer, 3-540-35909-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Adam Ouorou |
Epsilon-proximal decomposition method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 99(1), pp. 89-108, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
proximal point algorithms, large-scale programming, decomposition, convex optimization, multicommodity flows, cutting planes |
25 | Toshiyasu Arai |
Epsilon substitution method for theories of jump hierarchies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 41(2), pp. 123-153, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Claus-Peter Wirth |
A New Indefinite Semantics for Hilbert's Epsilon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2002, Copenhagen, Denmark, July 30 - August 1, 2002, Proceedings, pp. 298-314, 2002, Springer, 3-540-43929-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Christian Böhm 0001, Bernhard Braunmüller, Florian Krebs, Hans-Peter Kriegel |
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 2001 ACM SIGMOD international conference on Management of data, Santa Barbara, CA, USA, May 21-24, 2001, pp. 379-388, 2001, ACM, 1-58113-332-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
data mining, knowledge discovery, similarity search, high-dimensional space, similarity join, feature transformation |
25 | Michael Beeson |
Automatic Generation of Epsilon-Delta Proofs of Continuity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISC ![In: Artificial Intelligence and Symbolic Computation, International Conference AISC'98, Plattsburgh, New York, USA, September 16-18, 1998, Proceedings, pp. 67-83, 1998, Springer, 3-540-64960-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
25 | Luis A. Trejo, Carlos Sandoval |
Improving Back-Propagation: Epsilon-Back-Propagation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWANN ![In: From Natural to Artificial Neural Computation, International Workshop on Artificial Neural Networks, IWANN '95, Malaga-Torremolinos, Spain, June 7-9, 1995, Proceedings, pp. 427-432, 1995, Springer, 3-540-59497-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
25 | Dominique Michelucci |
An epsilon-Arithmetic for Removing Degeneracies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Symposium on Computer Arithmetic ![In: 12th Symposium on Computer Arithmetic (ARITH-12 '95), July 19-21, 1995, Bath, England, UK, pp. 230-, 1995, IEEE Computer Society, 0-8186-7089-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
21 | Zhi-Zhong Chen, Lusheng Wang 0001 |
Improved Approximation Algorithms for Reconstructing the History of Tandem Repeats. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 6(3), pp. 438-453, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, Computational biology |
21 | Travis Gagie, Marek Karpinski, Yakov Nekrich |
Low-Memory Adaptive Prefix Coding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 2009 Data Compression Conference (DCC 2009), 16-18 March 2009, Snowbird, UT, USA, pp. 13-22, 2009, IEEE Computer Society, 978-0-7695-3592-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Sebastian Nowozin, Koji Tsuda |
Frequent Subgraph Retrieval in Geometric Graph Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), December 15-19, 2008, Pisa, Italy, pp. 953-958, 2008, IEEE Computer Society, 978-0-7695-3502-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Dragana Veljkovic, Kay A. Robbins |
Force Feature Spaces for Visualization and Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMLA ![In: Seventh International Conference on Machine Learning and Applications, ICMLA 2008, San Diego, California, USA, 11-13 December 2008, pp. 426-433, 2008, IEEE Computer Society, 978-0-7695-3495-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Grant Schoenebeck |
Linear Level Lasserre Lower Bounds for Certain k-CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 593-602, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Glencora Borradaile, Philip N. Klein, Claire Mathieu |
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 115-124, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Yefim Dinitz, Michael Elkin, Shay Solomon |
Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 519-528, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Deeparnab Chakrabarty, Gagan Goel |
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 687-696, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Dimitris Achlioptas, Amin Coja-Oghlan |
Algorithmic Barriers from Phase Transitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 793-802, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Paul Beame, Dang-Trinh Huynh-Ngoc |
On the Value of Multiple Read/Write Streams for Approximating Frequency Moments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 499-508, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Dimitrios S. Kolovos, Richard F. Paige, Fiona Polack |
Detecting and Repairing Inconsistencies across Heterogeneous Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICST ![In: First International Conference on Software Testing, Verification, and Validation, ICST 2008, Lillehammer, Norway, April 9-11, 2008, pp. 356-364, 2008, IEEE Computer Society, 978-0-7695-3127-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Model Driven Development, Inconsistency Management, Model Consistency |
21 | Supasit Monpratarnchai, Tetsuo Tamai |
The Implementation and Execution Framework of a Role Model Based Language, EpsilonJ. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNPD ![In: Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2008, In conjunction with Second International Workshop on Advanced Internet Technology and Applications, August 6-8, 2008, Phuket, Thailand, pp. 269-276, 2008, IEEE Computer Society, 978-0-7695-3263-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Collaboration, Adaptation, Object, Role |
21 | Errol L. Lloyd, Guoliang Xue |
Relay Node Placement in Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 56(1), pp. 134-138, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
wireless sensor networks, approximation algorithms, Relay node placement |
21 | Srikanth Gottipati, Anil Nerode |
A Synthesis Algorithm for Hybrid Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings, pp. 254-268, 2007, Springer, 978-3-540-72732-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | C. He, Michael Lentmaier, Daniel J. Costello Jr., Kamil Sh. Zigangirov |
Joint Permutor Analysis and Design for Multiple Turbo Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(9), pp. 4068-4083, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Venkatesan Guruswami, Atri Rudra |
Limits to List Decoding Reed-Solomon Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(8), pp. 3642-3649, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Young-Sik Kim, Ji-Woong Jang, Jong-Seon No, Habong Chung |
New Design of Low-Correlation Zone Sequence Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(10), pp. 4607-4616, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Nikhil Bansal 0001, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha |
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(4), pp. 305-318, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Non-clairvoyant algorithms, Resourcelinebreak[4] augmentation, Scheduling, Online algorithms, Slowdown |
21 | Alex Iosevich, Izabella Laba |
Distance Sets of Well-Distributed Planar Point Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 31(2), pp. 243-250, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Rajeev Raman, S. Srinivasa Rao 0001 |
Succinct Dynamic Dictionaries and Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 357-368, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Sanjeev Arora, Kevin L. Chang |
Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 176-188, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Amitava Datta, Subbiah Soundaralakshmi, Robyn A. Owens |
Fast Sorting Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 13(3), pp. 212-222, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
reconfigurable bus, pipelined communication, merging, sorting algorithm, optical bus, deterministic sampling |
21 | Markus Bläser, Bodo Manthey |
Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 187-198, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Ari Freund 0001, Joseph Naor |
Approximating the Advertisement Placement Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 415-424, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Constantine Bekas, Effrosini Kokiopoulou, Efstratios Gallopoulos, Valeria Simoncini |
Parallel Computation of Pseudospectra Using Transfer Functions on a MATLAB-MPI Cluster Platform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PVM/MPI ![In: Recent Advances in Parallel Virtual Machine and Message Passing Interface, 9th European PVM/MPI Users' Group Meeting, Linz, Austria, September 29 - October 2, 2002, Proceedings, pp. 199-207, 2002, Springer, 3-540-44296-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Pankaj K. Agarwal, Jie Gao 0001, Leonidas J. Guibas |
Kinetic Medians and kd-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, pp. 5-16, 2002, Springer, 3-540-44180-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Danny Z. Chen, Michiel H. M. Smid, Bin Xu 0009 |
Geometric Algorithms for Density-Based Data Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, pp. 284-296, 2002, Springer, 3-540-44180-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Lars Engebretsen, Jonas Holmerin, Alexander Russell |
Inapproximability Results for Equations over Finite Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 73-84, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | V. S. Anil Kumar 0001, Madhav V. Marathe |
Improved Results for Stackelberg Scheduling Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 776-787, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Noam Nisan |
The Communication Complexity of Approximate Set Packing and Covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 868-875, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Jonas Holmerin |
Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 1005-1016, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Alexandre Tiskin |
Parallel Convex Hull Computation by Generalised Regular Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002, Proceedings, pp. 392-399, 2002, Springer, 3-540-44049-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Mart de Graaf, Ronald de Wolf |
On Quantum Versions of the Yao Principle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 347-358, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Aduri Pavan, Alan L. Selman |
Bi-Immunity Separates Strong NP-Completeness Notions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 408-418, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha |
Approximation Algorithms for Edge-Dilation k-Center Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 210-219, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Stephan J. Eidenbenz |
Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 60-68, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Nader H. Bshouty, Lynn Burroughs |
On the Proper Learning of Axis Parallel Concepts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Computational Learning Theory, 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002, Proceedings, pp. 287-302, 2002, Springer, 3-540-43836-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Hsueh-I Lu |
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 57-66, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | S. Mishra, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian |
On the Hardness of Approximating Minimum Monopoly Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings, pp. 277-288, 2002, Springer, 3-540-00225-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Ran Raz |
Resolution Lower Bounds for the Weak Pigeonhole Principle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 3, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Chi-Jen Lu |
Derandomizing Arthur-Merlin games under uniform assumptions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 10(3), pp. 247-259, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
graph nonisomorphism problem, nondeterminism, Derandomization, uniformity, Arthur-Merlin games |
21 | Yi Pan 0001, Si-Qing Zheng, Keqin Li 0001, Hong Shen 0001 |
An Improved Generalization of Mesh-Connected Computers with Multiple Buses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 12(3), pp. 293-305, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
mesh-connected computer with multiple buses, parallel algorithm, parallel computing, parallel architecture, processor array, Bus, mesh-connected computer |
21 | Véronique Ventos, Pierre Brézellec, Henry Soldano |
Explicitly Using Default Knowledge in Concept Learning: An Extended Description Logics Plus Strict and Default Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPNMR ![In: Logic Programming and Nonmonotonic Reasoning, 6th International Conference, LPNMR 2001, Vienna, Austria, September 17-19, 2001, Proceedings, pp. 173-185, 2001, Springer, 3-540-42593-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Andris Ambainis |
A new protocol and lower bounds for quantum coin flipping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 134-142, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Antonio Corral, Joaquín Cañadas, Michael Vassilakopoulos |
Processing Distance-Based Queries in Multidimensional Data Spaces Using R-trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Panhellenic Conference on Informatics ![In: Advances in Informatics, 8th Panhellenic Conference on Informatics, PCI 2001. Nicosia, Cyprus, November 8-10, 2001, Revised Selected Papers, pp. 1-18, 2001, Springer, 3-540-07544-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni |
Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(10), pp. 1090-1102, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Single hop distributed systems, minimum schedule length, scheduling, approximation algorithms, NP-completeness |
21 | Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda |
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pp. 204-215, 2000, Springer, 3-540-41255-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Klaus Jansen, Lorant Porkolab |
Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 878-889, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Michael Krivelevich, Van H. Vu |
Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 13-24, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro |
Efficient Communication in Unknown Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings, pp. 172-183, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Edson Cáceres, Albert Chan, Frank K. H. A. Dehne, Giuseppe Prencipe |
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings, pp. 83-94, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Sanjeev Kumar Mishra, Palash Sarkar 0001 |
Symmetrically Private Information Retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INDOCRYPT ![In: Progress in Cryptology - INDOCRYPT 2000, First International Conference in Cryptology in India, Calcutta, India, December 10-13, 2000, Proceedings, pp. 225-236, 2000, Springer, 3-540-41452-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Private Information retrieval (PIR), Symmetrically Private Information Retrieval (SPIR), Quadratic Residuacity Assumption (QRA), Cryptographic Protocols, Probabilistic Encryption |
21 | Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger |
Caching for Web Searching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings, pp. 150-163, 2000, Springer, 3-540-67690-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Sung-Ryul Kim, Kunsoo Park |
Efficient List Ranking Algorithms on Reconfigurable Mesh. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings, pp. 262-271, 2000, Springer, 3-540-67787-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Pietro Parodi, Roberto Fontana |
Efficient and flexible text extraction from document pages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Document Anal. Recognit. ![In: Int. J. Document Anal. Recognit. 2(2-3), pp. 67-79, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Segmentation accuracy, Computational complexity, Text extraction, Document segmentation |