|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9257 occurrences of 4327 keywords
|
|
|
Results
Found 24897 publication records. Showing 24897 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
20 | Haralampos Tsaknakis, Paul G. Spirakis |
An Optimization Approach for Approximate Nash Equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings, pp. 42-56, 2007, Springer, 978-3-540-77104-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Xuli Han |
Approximate Interpolation by Neural Networks with the Inverse Multiquadric Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISICA ![In: Advances in Computation and Intelligence, Second International Symposium, ISICA 2007, Wuhan, China, September 21-23, 2007, Proceedings, pp. 296-304, 2007, Springer, 978-3-540-74580-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Emanuele Viola |
On Approximate Majority and Probabilistic Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA, pp. 155-168, 2007, IEEE Computer Society, 0-7695-2780-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiaohui Yu 0001 |
Reasoning About Approximate Match Query Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, 3-8 April 2006, Atlanta, GA, USA, pp. 8, 2006, IEEE Computer Society, 0-7695-2570-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Sunil Arya, Theocharis Malamatos, David M. Mount |
The effect of corners on the complexity of approximate range searching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006, pp. 11-20, 2006, ACM, 1-59593-340-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithms, range searching, idempotence |
20 | Di Wang, Guoren Wang, Qingquan Wu, Baichen Chen, Yi Zhao |
A New Method for Finding Approximate Repetitions in DNA Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAIM ![In: Advances in Web-Age Information Management, 7th International Conference,WAIM 2006, Hong Kong, China, June 17-19, 2006, Proceedings, pp. 397-409, 2006, Springer, 3-540-35225-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack |
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 98-109, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Jason Crampton, Wing Leung, Konstantin Beznosov |
The secondary and approximate authorization model and its application to Bell-LaPadula policies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SACMAT ![In: 11th ACM Symposium on Access Control Models and Technologies, SACMAT 2006, Lake Tahoe, California, USA, June 7-9, 2006, Proceedings, pp. 111-120, 2006, ACM, 1-59593-353-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Bell-LaPadula model, authorization recycling, access control, SAAM |
20 | Tor Dokken, Jan B. Thomassen |
Weak Approximate Implicitization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SMI ![In: 2006 International Conference on Shape Modeling and Applications (SMI 2006), 14-16 June 2006, Matsushima, Japan, pp. 31, 2006, IEEE Computer Society, 0-7695-2591-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Davide Bilò, Luciano Gualà, Guido Proietti |
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings, pp. 295-309, 2006, Springer, 3-540-35474-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Jason B. Peltzer, Ankur Teredesai, Garrett Reinard |
AQUAGP: Approximate QUery Answers Using Genetic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroGP ![In: Genetic Programming, 9th European Conference, EuroGP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings, pp. 49-60, 2006, Springer, 3-540-33143-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Itnuit Janovitz-Freireich, Lajos Rónyai, Ágnes Szántó |
Approximate radical of ideals with clusters of roots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pp. 146-153, 2006, ACM, 1-59593-276-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Yongge Wang, Xintao Wu |
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 27-30 November 2005, Houston, Texas, USA, pp. 482-489, 2005, IEEE Computer Society, 0-7695-2278-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
inverse frequent itemset mining, data mining, privacy, complexity |
20 | Zheng Liu, Xin Chen 0037, James Borneman, Tao Jiang 0001 |
A Fast Algorithm for Approximate String Matching on Gene Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings, pp. 79-90, 2005, Springer, 3-540-26201-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Stéphane Zampelli, Yves Deville, Pierre Dupont |
Approximate Constrained Subgraph Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings, pp. 832-836, 2005, Springer, 3-540-29238-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Dazhou Kang, Hanwu Chen, Baowen Xu, Jianjiang Lu, Keyue Li, William C. Chu |
Approximate Information Retrieval for Heterogeneity Ontologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CW ![In: 4th International Conference on Cyberworlds (CW 2005), 23-25 November 2005, Singapore, pp. 539-544, 2005, IEEE Computer Society, 0-7695-2378-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Martin Gavrilov, Piotr Indyk, Rajeev Motwani 0001, Suresh Venkatasubramanian |
Combinatorial and Experimental Methods for Approximate Point Pattern Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 38(1), pp. 59-90, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell 0001 |
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings, pp. 200-215, 2003, Springer, 3-540-00897-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Brian Babcock, Surajit Chaudhuri, Gautam Das 0001 |
Dynamic Sample Selection for Approximate Query Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, San Diego, California, USA, June 9-12, 2003, pp. 539-550, 2003, ACM, 1-58113-634-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu |
Approximate String Matching in DNA Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Eighth International Conference on Database Systems for Advanced Applications (DASFAA '03), March 26-28, 2003, Kyoto, Japan, pp. 303-310, 2003, IEEE Computer Society, 0-7695-1895-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Jiong Yang 0001, Wei Wang 0010, Yi Xia, Philip S. Yu |
Accelerating Approximate Subsequence Search on Large Protein Sequence Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSB ![In: 1st IEEE Computer Society Bioinformatics Conference, CSB 2002, Stanford, CA, USA, August 14-16, 2002, pp. 207-, 2002, IEEE Computer Society, 0-7695-1653-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Sunil Arya, Theocharis Malamatos, David M. Mount |
Space-efficient approximate Voronoi diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 721-730, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Q. Su, Venkataramanan Balakrishnan, Cheng-Kok Koh |
Efficient Approximate Balanced Truncation of General Large-Scale RLC Systems via Krylov Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC/VLSI Design ![In: Proceedings of the 7th Asia and South Pacific Design Automation Conference (ASP-DAC 2002), and the 15th International Conference on VLSI Design (VLSI Design 2002), Bangalore, India, January 7-11, 2002, pp. 311-316, 2002, IEEE Computer Society, 0-7695-1299-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Krylov, large scale systems, model reduction, RLC interconnects, balanced truncation |
20 | Kouta Kanda, Makoto Haraguchi, Yoshiaki Okubo |
Constructing Approximate Informative Basis of Association Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, 4th International Conference, DS 2001, Washington, DC, USA, November 25-28, 2001, Proceedings, pp. 141-154, 2001, Springer, 3-540-42956-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Weiping Zhu 0001 |
An approximate analysis of the shortest queue policy on soft real-time scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS Perform. Evaluation Rev. ![In: SIGMETRICS Perform. Evaluation Rev. 28(3), pp. 3-10, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
20 | Shyue-Liang Wang, Jenn-Shing Tsai |
Discovery of approximate dependencies from proximity-based fuzzy databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES ![In: Third International Conference on Knowledge-Based Intelligent Information Engineering Systems, KES 1999, Adelaide, South Australia, 31 August - 1 September 1999, Proceedings, pp. 234-237, 1999, IEEE, 0-7803-5578-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
20 | Hai Wang 0008, Kenneth C. Sevcik |
Experiments with Improved Approximate Mean Value Analysis Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computer Performance Evaluation (Tools) ![In: Computer Performance Evaluation: Modelling Techniques and Tools, 10th International Conference, Tools '98, Palma de Mallorca, Spain, September 14-18, 1998, Proceedings, pp. 280-291, 1998, Springer, 3-540-64949-2. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
20 | Shiva Chaudhuri, Torben Hagerup, Rajeev Raman |
Approximate and Exact Deterministic Parallel Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993, Proceedings, pp. 352-361, 1993, Springer, 3-540-57182-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
20 | John Zahorjan, Edward D. Lazowska |
Incorporating Load Dependent Servers in Approximate Mean Value Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS ![In: Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems, Cambridge, Massachusetts, USA, August 21-24, 1984, pp. 52-62, 1984, ACM, 0-89791-141-5. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
20 | Stefan Ratschan |
Convergent approximate solving of first-order constraints by approximate quantifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 5(2), pp. 264-281, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
constraints, Decision procedures, real numbers, generalized quantifiers |
20 | Liguo Jiao, Jae-Hyoung Lee |
Approximate Optimality and Approximate Duality for Quasi Approximate Solutions in Robust Convex Semidefinite Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Optim. Theory Appl. ![In: J. Optim. Theory Appl. 176(1), pp. 74-93, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Dominik Slezak |
Toward Approximate Intelligence: Approximate Query Engines & Approximate Data Exploration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW (Companion Volume) ![In: Companion of the The Web Conference 2018 on The Web Conference 2018, WWW 2018, Lyon , France, April 23-27, 2018, pp. 1687, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
17 | James Cheng, Yiping Ke, Wilfred Ng |
A survey on algorithms for mining frequent itemsets over data streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 16(1), pp. 1-27, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Window models, Approximate algorithms, Frequent itemsets, Stream mining |
17 | Saoussen Bel Hadj Kacem, Amel Borgi, Khaled Ghédira |
Generalized Modus Ponens Based on Linguistic Modifiers in a Symbolic Multi-Valued Framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), 22-23 May 2008, Dallas, Texas, USA, pp. 150-155, 2008, IEEE Computer Society, 978-0-7695-3155-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Generalized Modus Ponens, linguistic modifiers, symbolic multi-valued logic, Approximate reasoning |
17 | Vasundhara Puttagunta, Konstantinos Kalpakis |
Accuracy vs. Lifetime: Linear Sketches for Aggregate Queries in Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 49(4), pp. 357-385, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Linear sketching, Sensor networks, Approximate query answering, In-network aggregation |
17 | Dongxia Sun, Lihong Zhi |
Structured Low Rank Approximation of a Bezout Matrix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(2), pp. 427-437, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Bezout matrix, approximate greatest common divisor, structured nonlinear total least squares, symbolic/numeric hybrid method |
17 | Alfredo Cuzzocrea |
An accuracy-aware compression technique for multidimensional data cubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), Dijon, France, April 23-27, 2006, pp. 515-516, 2006, ACM, 1-59593-108-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
data compression techniques, OLAP, approximate query answering |
17 | Davide Bilò, Luciano Gualà, Guido Proietti |
Dynamic Mechanism Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings, pp. 3-15, 2006, Springer, 3-540-68138-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
On-line Problems, Approximate Mechanisms, Dynamic Algorithms, Algorithmic Mechanism Design |
17 | Anja Klein 0001, Rainer Gemulla, Philipp Rösch, Wolfgang Lehner |
Derby/S: a DBMS for sample-based query answering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, June 27-29, 2006, pp. 757-759, 2006, ACM, 1-59593-256-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
sampling, approximate query answering |
17 | Lucian Ilie, Liviu Tinta, Cristian Popescu, Kathleen A. Hill |
Viral Genome Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DNA ![In: DNA Computing, 12th International Meeting on DNA Computing, DNA12, Seoul, Korea, June 5-9, 2006, Revised Selected Papers, pp. 111-126, 2006, Springer, 3-540-49024-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
viral genomes, genome compression, overlapping genes, shortest common superstring problem, lower bounds, exact algorithms, viruses, approximate solutions |
17 | Nicos Karcanias, Marilena Mitrouli, Dimitrios Triantafyllou |
A Hybrid Approach for Normal Factorization of Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (2) ![In: Computational Science - ICCS 2006, 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part II, pp. 399-406, 2006, Springer, 3-540-34381-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Polynomials, factorization, greatest common divisor, approximate computations |
17 | Villy Bæk Iversen, Sergey N. Stepanov, A. V. Kostrov |
Dimensioning of Multiservice Links Taking Account of Soft Blocking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NEW2AN ![In: Next Generation Teletraffic and Wired/Wireless Advanced Networking, 6th International Conference, NEW2AN 2006, St. Petersburg, Russia, May 29 - June 2, 2006, Proceedings, pp. 3-10, 2006, Springer, 3-540-34429-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
approximate algorithms, wireless, CDMA, dimensioning, trunk reservation, teletraffic, soft blocking |
17 | Richard Cole 0001, Lee-Ad Gottlieb |
Searching dynamic point sets in spaces with bounded doubling dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 574-583, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
approximate nearest neighbor search |
17 | Gergely Korodi, Ioan Tabus |
An efficient normalized maximum likelihood algorithm for DNA sequence compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Inf. Syst. ![In: ACM Trans. Inf. Syst. 23(1), pp. 3-34, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Approximate sequence matching, DNA compression, normalized maximum likelihood model |
17 | Yan-Wen Guo 0001, Jin Wang, Xiufen Cui, Qunsheng Peng 0001 |
A New Constrained Texture Mapping Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICEC ![In: Entertainment Computing - ICEC 2005, 4th International Conference, Sanda, Japan, September 19-21, 2005, Proceedings, pp. 48-58, 2005, Springer, 3-540-29034-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Approximate shortest path, Texture mapping, Morphing |
17 | Luciano Gualà, Guido Proietti |
A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 390-400, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Approximate Truthful Mechanisms, Algorithmic Mechanism Design, Steiner Tree Problem, Selfish Agents |
17 | Antonio Corral, Yannis Manolopoulos, Yannis Theodoridis, Michael Vassilakopoulos |
Multi-Way Distance Join Queries in Spatial Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GeoInformatica ![In: GeoInformatica 8(4), pp. 373-402, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
distance join queries, spatial databases, R-trees, branch-and-bound algorithms, approximate techniques |
17 | Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni |
Locality-sensitive hashing scheme based on p-stable distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 253-262, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
p-stable distributions, locally sensitive hashing, sublinear algorithm, approximate nearest neighbor |
17 | Paolo Penna, Carmine Ventre |
Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PE-WASUN ![In: Proceedings of the 1st ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, PE-WASUN 2004, Venezia, Italy, October 4, 2004, pp. 61-68, 2004, ACM, 1-58113-959-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
light approximate shortest-path trees, wireless ad hoc networks, energy consumption, multicast trees |
17 | Sarajane Marques Peres, Márcio Luiz De Andrade Netto |
A Fractal Fuzzy Approach to Clustering Tendency Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SBIA ![In: Advances in Artificial Intelligence - SBIA 2004, 17th Brazilian Symposium on Artificial Intelligence, São Luis, Maranhão, Brazil, September 29 - October 1, 2004, Proceedings, pp. 395-404, 2004, Springer, 3-540-23237-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Clustering Tendency Analysis, Fractal Dimension Theory, Fuzzy Approximate Reasoning |
17 | Zheng Zheng 0001, Hong Hu 0001, Zhongzhi Shi |
Rough Set Based Image Texture Recognition Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES ![In: Knowledge-Based Intelligent Information and Engineering Systems, 8th International Conference, KES 2004, Wellington, New Zealand, September 20-25, 2004. Proceedings. Part I, pp. 772-778, 2004, Springer, 3-540-23318-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Rough Set, Image Texture, Approximate Space |
17 | Sudipto Guha, Dimitrios Gunopulos, Nick Koudas |
Correlating synchronous and asynchronous data streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24 - 27, 2003, pp. 529-534, 2003, ACM, 1-58113-737-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
data streams, singular value decomposition, approximate computation |
17 | Ela Hunt, Malcolm P. Atkinson 0001, Robert W. Irving |
Database indexing for large DNA and protein sequence collections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 11(3), pp. 256-271, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Suffix tree, Approximate matching, Database index, Biological sequence |
17 | Ertem Tuncel, Hakan Ferhatosmanoglu, Kenneth Rose |
VQ-index: an index structure for similarity searching in multimedia databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Multimedia ![In: Proceedings of the 10th ACM International Conference on Multimedia 2002, Juan les Pins, France, December 1-6, 2002., pp. 543-552, 2002, ACM, 1-58113-620-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
approximate similarity searching, retrieved information reduction, retrieved set reduction, clustering, indexing, vector quantization |
17 | Maria I. Sessa |
Translations and similarity-based logic programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 5(2), pp. 160-170, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Logic Programming, Abstract interpretation, Approximate reasoning, Galois connection, Similarity relation |
17 | Kian-Lee Tan, Cheng Hian Goh, Beng Chin Ooi |
Progressive evaluation of nested aggregate queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 9(3), pp. 261-278, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Nested aggregate queries, Approximate answers, Progressive query processing, Multi-threading, Online aggregation |
17 | Grace SauLan Loo, Kok-Huat Lee |
An Interface to Databases for Flexible Query Answering: A Fuzzy-Set Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEXA ![In: Database and Expert Systems Applications, 11th International Conference, DEXA 2000, London, UK, September 4-8, 2000, Proceedings, pp. 654-663, 2000, Springer, 3-540-67978-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
alpha-cut, design, interface, approximate, flexibility, fuzzy, linguistic, imprecise, query modification |
17 | Maritza Bracho de Rodríguez, José Alí Moreno |
Heuristic Algorithm for Robot Path Planning Based on Real Space Renormalization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IBERAMIA-SBIA ![In: Advances in Artificial Intelligence, International Joint Conference, 7th Ibero-American Conference on AI, 15th Brazilian Symposium on AI, IBERAMIA-SBIA 2000, Atibaia, SP, Brazil, November 19-22, 2000, Proceedings, pp. 379-388, 2000, Springer, 3-540-41276-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Real Space Renormalization, Approximate Cell Decomposition, Path Planning, Heuristic Algorithm |
17 | Bruno Carpentieri, Iain S. Duff, Luc Giraud |
Robust Preconditioning of Dense Problems from Electromagnetics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NAA ![In: Numerical Analysis and Its Applications, Second International Conference, NAA 2000, Rousse, Bulgaria, June 11-15, 2000, Revised Papers, pp. 170-178, 2000, Springer, 3-540-41814-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Preconditioning techniques, sparse approximate inverses, nonzero pattern selection strategies, electromagnetic scattering applications, AMS subject classification: 65F10, 78A45, 78A50, 78-08, 65R20, 65F50, 65N38 |
17 | Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón |
Fast Evolutionary Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25 - December 2, 2000, Proceedings, pp. 307-318, 2000, Springer, 3-540-41348-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
computer-assisted music analysis, dynamic programming, approximate string matching, String algorithms |
17 | Ramón Alberto Mollineda, Enrique Vidal 0001, Francisco Casacuberta |
Efficient Techniques for a Very Accurate Measurement of Dissimilarities between Cyclic Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSPR/SPR ![In: Advances in Pattern Recognition, Joint IAPR International Workshops SSPR 2000 and SPR 2000, [8th International Workshop on Structural and Syntactic Pattern Recognition, 3rd International Workshop on Statistical Techniques in Pattern Recognition], Alicante, Spain, August 30 - September 1, 2000, Proceedings, pp. 337-346, 2000, Springer, 3-540-67946-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
cyclic patterns, cyclic strings, structural pattern analysis, 2d shape recognition, approximate string matching |
17 | Mikhail J. Atallah, Yann Génin, Wojciech Szpankowski |
Pattern Matching Image Compression: Algorithmic and Empirical Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 21(7), pp. 614-627, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Lossy Lempel-Ziv scheme, generalized Shannon entropy, Hamming and square root distortion, algorithms on words, Fast Fourier Transform, image compression, approximate pattern matching |
17 | Arcot Rajasekar |
String-Oriented Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE/CRIWG ![In: Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, SPIRE/CRIWG 1999, Cancun, Mexico, September 21-24, 1999, pp. 158-167, 1999, IEEE Computer Society, 0-7695-0268-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
query processing, pattern-matching, datalog, relational algebra, approximate reasoning |
17 | Li-Jen Mao, Narsingh Deo, Sheau-Dong Lang |
A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 23-25 June 1999, Fremantle, Australia, pp. 184-189, 1999, IEEE Computer Society, 0-7695-0231-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Parallel approximate algorithm, degree-constrained MST, reciprocal nearest neighbors, minimum spanning tree |
17 | Hsi-Chieh Lee, Fikret Erçal |
RMESH Algorithms for Parallel String Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 18-20 December 1997, Taipei, Taiwan, pp. 223-226, 1997, IEEE Computer Society, 0-8186-8259-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Reconfigurable Mesh Architecture, RMESH, Parallel Algorithms, String Matching, Approximate String Matching |
17 | Michael Minock, Wesley W. Chu |
Explanation for Cooperative Information Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 9th International Symposium, ISMIS '96, Zakopane, Poland, June 9-13, 1996, Proceedings, pp. 264-273, 1996, Springer, 3-540-61286-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Approximate Answers, CoBase, Explanation, Knowledge Integration, Intelligent Information Systems, Dialogue Management, Cooperative Information Systems |
17 | Hagit Attiya, Nancy A. Lynch, Nir Shavit |
Are Wait-Free Algorithms Fast? ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(4), pp. 725-763, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
approximate agreement, fault-tolerance, wait-free |
17 | Yves Dallery, Stanley B. Gershwin |
Manufacturing flow line systems: a review of models and analytical results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 12(1-2), pp. 3-94, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
Manufacturing flow line systems, modelling, performance, evaluation, failures, blocking, analytical methods, approximate analysis, exact analysis |
17 | Anthony E. Krzesinski, J. Greyling |
Improved Lineariser Methods for Queueing Networks with Queue Dependent Centres. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS ![In: Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems, Cambridge, Massachusetts, USA, August 21-24, 1984, pp. 41-51, 1984, ACM, 0-89791-141-5. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
Product from solutions, Error analysis, Mean value analysis, Approximate solutions, Multiclass queueing networks |
17 | Dalie Sun, Sai Wu, Shouxu Jiang, Jianzhong Li 0001 |
Approximate Aggregations in Structured P2P Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 23(11), pp. 1748-1752, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
BATON, Peer-to-Peer, approximate query processing |
17 | René Brunner, Felix Freitag, Leandro Navarro 0001 |
Self-Regulated Trade-Off among Timeliness, Messages and Accuracy for Approximate Queries in Large-Scale Information Aggregation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NBiS ![In: The 14th International Conference on Network-Based Information Systems, NBiS 2011, Tirana, Albania, September 7-9, 2011, pp. 258-267, 2011, IEEE Computer Society, 978-1-4577-0789-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
Large-scale Information Aggregation, Computational Grids and Clouds, Autonomic Management, Approximate Queries |
17 | Taijin Yoon, Sun-Young Park, Hwan-Gue Cho |
A Smart Filtering System for Newly Coined Profanities by Using Approximate String Alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIT ![In: 10th IEEE International Conference on Computer and Information Technology, CIT 2010, Bradford, West Yorkshire, UK, June 29-July 1, 2010, pp. 643-650, 2010, IEEE Computer Society, 978-0-7695-4108-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
profanity filter, sequence alignment, approximate string matching |
17 | Wing-Kai Hon, Winson Wu, Ting-Shuo Yang |
Compressed Indexes for Approximate Library Management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 2010 Data Compression Conference (DCC 2010), 24-26 March 2010, Snowbird, UT, USA, pp. 534, 2010, IEEE Computer Society, 978-0-7695-3994-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
compressed index, library management, suffix array, approximate matching |
17 | Dan Gutfreund, Akinori Kawachi |
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, USA, June 9-12, 2010, pp. 38-49, 2010, IEEE Computer Society, 978-0-7695-4060-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Arthur-Merlin protocols, derandomization, circuit complexity, approximate counting |
17 | Jinghui Zhang, Junzhou Luo, Zhiang Wu 0001 |
A Novel Approximate Algorithm for Admission Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings, pp. 314-325, 2009, Springer, 978-3-642-02269-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximate algorithm, admission control, local ratio, multiple resources |
17 | Hong Shen 0001, Yu Zhang |
Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 23(6), pp. 973-987, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
data stream, bloom filter, sliding window, duplicate detection, approximate query |
17 | Zi Huang, Heng Tao Shen, Xiaofang Zhou 0001 |
Localized Co-Occurrence Model for Fast Approximate Search in 3D Structure Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 20(4), pp. 519-531, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Simialrity Search, Structural and Statistical Database, Approximate Search |
17 | Jun-hong Hu, Ying-jie Lei |
Techniques for Approximate Reasoning Based on Intuitionistic Fuzzy S-Rough Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PACIIA (1) ![In: PACIIA 2008, Volume 1, 2008 IEEE Pacific-Asia Workshop on Computational Intelligence and Industrial Application, 19-20 December 2008, Wuhan, China, pp. 277-281, 2008, IEEE Computer Society, 978-0-7695-3490-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Intuitionistic Fuzzy S-Rough sets, Intuitionistic Fuzzy S-Rough Logic, approximate reasoning |
17 | Julien Demouth, Olivier Devillers, Marc Glisse, Xavier Goaoc |
Helly-type theorems for approximate covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, pp. 120-128, 2008, ACM, 978-1-60558-071-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
3d visibility, approximate covering, helly-type theorems, lp-type problems |
17 | Kaushik Chakrabarti, Surajit Chaudhuri, Venkatesh Ganti, Dong Xin |
An efficient filter for approximate membership checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10-12, 2008, pp. 805-818, 2008, ACM, 978-1-60558-102-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximate membership checking, filtering, string match |
17 | Yalin Zheng, Guang Yang 0002, Changshui Zhang, Jing Zheng, Yunpeng Xu |
Equivalence Knowledge Mass and Approximate Reasoning in -Logic (I). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 4th International Conference on Intelligent Computing, ICIC 2008, Shanghai, China, September 15-18, 2008, Proceedings, pp. 391-400, 2008, Springer, 978-3-540-85983-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Knowledge Cumularspharolith, Formulae Cumularspharolith, Approximate Knowledge Closure of Knowledge Base, Pseudo-distance, automatic Reasoning System, completeness |
17 | Filip Korc, Wolfgang Förstner |
Approximate Parameter Learning in Conditional Random Fields: An Empirical Investigation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAGM-Symposium ![In: Pattern Recognition, 30th DAGM Symposium, Munich, Germany, June 10-13, 2008, Proceedings, pp. 11-20, 2008, Springer, 978-3-540-69320-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Approximate parameter learning, pseudo-likelihood, Markov Random Field, Conditional Random Field |
17 | Joachim von zur Gathen, Igor E. Shparlinski |
Approximate Polynomial gcd: Small Degree and Small Height Perturbations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 276-283, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Euclidean algorithm, gcd, approximate computation |
17 | Nedialko B. Dimitrov, Indrajit Roy 0001 |
A primal-dual resource augmentation analysis of a constant approximate algorithm for stable coalitions in a cluster. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, June 14-16, 2008, pp. 236-245, 2008, ACM, 978-1-59593-973-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximate core equilibrium, facility location, resource augmentation, primal-dual |
17 | Arianna D'Ulizia, Fernando Ferri, Patrizia Grifoni |
Approximate Queries by Relaxing Structural Constraints in GIS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ER Workshops ![In: Advances in Conceptual Modeling - Foundations and Applications, ER 2007 Workshops CMLSA, FP-UML, ONISW, QoIS, RIGiM,SeCoGIS, Auckland, New Zealand, November 5-9, 2007, Proceedings, pp. 398-408, 2007, Springer, 978-3-540-76291-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Geographical information systems, semantic similarity, structural similarity, approximate queries |
17 | Patrick Doherty 0001, Barbara Dunin-Keplicz, Andrzej Szalas |
Dynamics of Approximate Information Fusion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSEISP ![In: Rough Sets and Intelligent Systems Paradigms, International Conference, RSEISP 2007, Warsaw, Poland, June 28-30, 2007, Proceedings, pp. 668-677, 2007, Springer, 978-3-540-73450-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
information fusion, approximate reasoning, similarity relation |
17 | Erich L. Kaltofen, Bin Li, Kartik Sivaramakrishnan, Zhengfeng Yang, Lihong Zhi |
Lower bounds for approximate factorizations via semidefinite programming: (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNC ![In: Symbolic-Numeric Computation, SNC 2007, International Workshop, 25-27 July 2007, University of Western Ontario, London, Ontario, Canada, pp. 203-204, 2007, ACM, 978-1-59593-744-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hybrid method, SDP, approximate factorization |
17 | Oswald Lanz |
Approximate Bayesian Multibody Tracking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 28(9), pp. 1436-1449, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Bayes filter, Computer vision, tracking, particle filter, occlusion, approximate inference |
17 | Amol Deshpande, Carlos Guestrin, Samuel Madden 0001, Joseph M. Hellerstein, Wei Hong 0001 |
Model-based approximate querying in sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 14(4), pp. 417-443, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Conditional plans, Model-driven data acquisition, Sensor networks, Probabilistic models, Approximate querying |
17 | Renato Bueno, Agma J. M. Traina, Caetano Traina Jr. |
Accelerating approximate similarity queries using genetic algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, March 13-17, 2005, pp. 617-622, 2005, ACM, 1-58113-964-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
genetic algorithms, similarity queries, approximate queries, metric access methods |
17 | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum |
The Relative Complexity of Approximate Counting Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 38(3), pp. 471-500, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Computational complexity, Approximate counting |
17 | Erich L. Kaltofen, John P. May |
On approximate irreducibility of polynomials in several variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2003, Drexel University, Philadelphia, Pennsylvania, USA, August 3-6, 2003, Proceedings, pp. 161-168, 2003, ACM, 1-58113-641-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
absolute irreducibility, effective Noether irreducibility forms, multivariate polynomial factorization, radius of irreducibility, approximate factorization, symbolic/numeric hybrid method |
17 | Venkatesan Guruswami, Johan Håstad, Madhu Sudan 0001 |
Hardness of Approximate Hypergraph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 149-158, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
approximate hypergraph coloring, covering complexity, probabilistic verifier, PCP verifier, 2-colorable 4-uniform hypergraph, hardness assumption, computational complexity, computational geometry, minimisation, graph colouring, hardness, minimization problems |
17 | Kimmo Fredriksson, Esko Ukkonen |
Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: Seventh International Symposium on String Processing and Information Retrieval, SPIRE 2000, A Coruña, Spain, September 27-29, 2000, pp. 96-104, 2000, IEEE Computer Society, 0-7695-0746-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
combinatorial methods, 3D arrays, three-dimensional pattern, three-dimensional volume, biological virus, pattern matching, translations, rotations, distance measures, voxels, incremental algorithms, minimum distance, three dimensional reconstruction, filtering algorithms, approximate pattern matching, real data |
17 | Sung-Hyuk Cha, Yong-Chul Shin, Sargur N. Srihari |
Approximate Stroke Sequence String Matching Algorithm for Character Recognition and Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Fifth International Conference on Document Analysis and Recognition, ICDAR 1999, 20-22 September, 1999, Bangalore, India, pp. 53-56, 1999, IEEE Computer Society, 0-7695-0318-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Pattern Matching, Character Recognition, Approximate String Matching, Handwriting Analysis, Chain-code |
17 | Felice Balarin |
Approximate reachability analysis of timed automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS '96), December 4-6, 1996, Washington, DC, USA, pp. 52-61, 1996, IEEE Computer Society, 0-8186-7689-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
approximate reachability analysis, unsafe states, incorrect system, discrete state components, real-time systems, formal verification, Boolean functions, computation, timed automata, finite automata, finite state automata, timing information |
17 | Ton Sales |
From Pure to Approximate Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 26th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1996, Santiago de Compostela, Spain, May 29-31, 1996, Proceedings, pp. 148-153, 1996, IEEE Computer Society, 0-8186-7392-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
approximate logic, theoretician, abstract methods, Helena Rasiowa, artificial intelligence, computer science, formal logic, bibliographies, biographies |
17 | Eric Schenk |
Faster Approximate Agreement with Multi-Writer Registers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 714-723, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
multi-writer registers, wait-free approximate agreement problem, asynchronous shared memory, single-bit multi-writer multi-reader registers, wait-free single-writer multi-reader, wait-free multi-writer multi-reader, computational complexity, complexity, distributed algorithms, lower bounds, shared memory systems, upper bounds, shared registers |
17 | M. W. Du, S. C. Chang |
An Approach to Designing Very Fast Approximate String Matching Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 6(4), pp. 620-633, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
fast approximate string matching algorithms, spelling errors, four-step reduction procedure, library book catalog textbase, large dictionary, multiple fault model, information retrieval, query processing, fault model, database theory, error correction, error correction, search problems, dictionary, nearest neighbor search, character strings, sequential computer, hashing techniques |
17 | David R. Karger, Rajeev Motwani 0001, Madhu Sudan 0001 |
Approximate Graph Coloring by Semidefinite Programming ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 2-13, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
approximate graph coloring, k-colorable graphs, randomized polynomial time algorithm, semidefinite optimization problems, MAX 2-SAT problems, duality relationship, lower bounds, linear programs, semidefinite programming, vertices, chromatic number, MAX CUT, approximation ratio |
Displaying result #301 - #400 of 24897 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ >>] |
|