|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 27762 occurrences of 10021 keywords
|
|
|
Results
Found 30183 publication records. Showing 30179 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
46 | Maria Cristina Pinotti, Vincenzo A. Crupi, Sajal K. Das 0001 |
A Parallel Solution to the Extended Set Union Problem with Unlimited Backtracking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '96, The 10th International Parallel Processing Symposium, April 15-19, 1996, Honolulu, Hawaii, USA, pp. 182-186, 1996, IEEE Computer Society, 0-8186-7255-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
parallel solution, extended set union problem, unlimited backtracking, Find, SetUnion, MultiUnion, k-Parallel Union Find trees, constant parallel time, optimal work, constant-time performance, parallel algorithms, computational complexity, data structure, parallel machines, Restore, backtracking, Backtrack, tree data structures, tree searching, random-access storage, dynamic partition, Union, EREW-PRAM model |
43 | Pankaj K. Agarwal, Lars Arge, Ke Yi 0001 |
I/O-efficient batched union-find and its applications to terrain analysis. ![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. 167-176, 2006, ACM, 1-59593-340-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
terrain analysis, algorithms, union-find, I/O-efficient, contour trees |
41 | Robert C. Miller, Alisa M. Marshall |
Cluster-based find and replace. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI ![In: Proceedings of the 2004 Conference on Human Factors in Computing Systems, CHI 2004, Vienna, Austria, April 24 - 29, 2004, pp. 57-64, 2004, ACM, 1-58113-702-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
find & replace, clustering, text editing, error prevention |
40 | Mark D. Smucker, James Allan |
Find-similar: similarity browsing as a search tool. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGIR ![In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Seattle, Washington, USA, August 6-11, 2006, pp. 461-468, 2006, ACM, 1-59593-369-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
find-similar, similarity browsing, relevance feedback |
38 | Sylvain Conchon, Jean-Christophe Filliâtre |
A persistent union-find data structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ML ![In: Proceedings of the ACM Workshop on ML, 2007, Freiburg, Germany, October 5, 2007, pp. 37-46, 2007, ACM, 978-1-59593-676-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
formal verification, persistence, union-find |
35 | Haim Kaplan, Nira Shafrir, Robert Endre Tarjan |
Union-find with deletions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 19-28, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
35 | Marek J. Lao |
A Class of Tree-Like UNION-FIND Data Structures and the Nonlinearity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings, pp. 255-267, 1981, Springer, 3-540-10828-9. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
computational complexity, data structures, trees, UNION-FIND, set union |
34 | Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov |
Improving 3N Circuit Complexity Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 32(2), pp. 13, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
34 | Giorgio Trumpy, Casper Find Andersen, Ivar Farup, Omar Elezabi |
Mapping Quantitative Observer Metamerism of Displays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Imaging ![In: J. Imaging 9(10), pp. 227, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
34 | Casper Find Andersen, Ivar Farup, Jon Yngve Hardeberg |
Additivity Constrained Linearisation of Camera Calibration Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 32, pp. 3774-3789, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
34 | Joan Boyar, Magnus Gausdal Find, René Peralta 0001 |
Small low-depth circuits for cryptographic applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cryptogr. Commun. ![In: Cryptogr. Commun. 11(1), pp. 109-127, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
34 | Magnus Gausdal Find, René Peralta 0001 |
Better Circuits for Binary Polynomial Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 68(4), pp. 624-630, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
34 | Joan Boyar, Magnus Gausdal Find |
Multiplicative complexity of vector valued Boolean functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 720, pp. 36-46, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
34 | Magnus Gausdal Find, Daniel Smith-Tone, Meltem Sönmez Turan |
The number of boolean functions with multiplicative complexity 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Inf. Coding Theory ![In: Int. J. Inf. Coding Theory 4(4), pp. 222-236, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
34 | Joan Boyar, Magnus Gausdal Find, René Peralta 0001 |
On various nonlinearity measures for boolean functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cryptogr. Commun. ![In: Cryptogr. Commun. 8(3), pp. 313-330, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
34 | Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen |
Separating OR, SUM, and XOR circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 82(5), pp. 793-801, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
34 | Casper Find Andersen, David Connah |
Weighted Constrained Hue-Plane Preserving Camera Characterization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 25(9), pp. 4329-4339, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
34 | Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov |
A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, pp. 89-98, 2016, IEEE Computer Society, 978-1-5090-3933-3. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
34 | Joan Boyar, Magnus Gausdal Find |
Cancellation-free circuits in unbounded and bounded depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 590, pp. 17-26, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
34 | Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov |
A better-than-3n lower bound for the circuit complexity of an explicit function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR15, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
34 | Magnus Gausdal Find, Daniel Smith-Tone, Meltem Sönmez Turan |
The Number of Boolean Functions with Multiplicative Complexity 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2015, pp. 1041, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
34 | Michal Mackiewicz, Casper Find Andersen, Graham D. Finlayson |
Hue Plane Preserving Colour Correction using Constrained Least Squares Regression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIC ![In: 23rd Color and Imaging Conference, CIC 2015, Darmstadt, Germany, October 19-23, 2015, pp. 18-23, 2015, Society for Imaging Science and Technology, 978-1-51081-435-6. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
34 | Joan Boyar, Magnus Gausdal Find |
Constructive Relationships Between Algebraic Thickness and Normality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, pp. 106-117, 2015, Springer, 978-3-319-22176-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
34 | Joan Boyar, Magnus Gausdal Find |
Constructive Relationships Between Algebraic Thickness and Normality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1410.1318, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
34 | Joan Boyar, Magnus Gausdal Find |
The Relationship Between Multiplicative Complexity and Nonlinearity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1407.6169, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
34 | Magnus Gausdal Find |
On the Complexity of Computing Two Nonlinearity Measures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1403.0417, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
34 | Joan Boyar, Magnus Gausdal Find |
The Relationship between Multiplicative Complexity and Nonlinearity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS (2) ![In: Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II, pp. 130-140, 2014, Springer, 978-3-662-44464-1. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
34 | Magnus Gausdal Find |
On the Complexity of Computing Two Nonlinearity Measures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings, pp. 167-175, 2014, Springer, 978-3-319-06685-1. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
34 | Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen |
Separating OR, SUM, and XOR Circuits ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1304.0513, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
34 | Joan Boyar, Magnus Find |
Cancellation-Free Circuits in Unbounded and Bounded Depth ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1305.3041, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
34 | Joan Boyar, Magnus Find, René Peralta 0001 |
Four Measures of Nonlinearity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2013, pp. 633, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
34 | Joan Boyar, Magnus Gausdal Find |
Cancellation-Free Circuits in Unbounded and Bounded Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings, pp. 159-170, 2013, Springer, 978-3-642-40163-3. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
34 | Joan Boyar, Magnus Find, René Peralta 0001 |
Four Measures of Nonlinearity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings, pp. 61-72, 2013, Springer, 978-3-642-38232-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
34 | Joan Boyar, Magnus Find |
Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1207.5321, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
34 | Milan Koren, Slavomír Find'o, Michaela Skuban, Matús Kajba |
Habitat suitability modelling from non-point data: The case study of brown bear habitat in Slovakia. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ecol. Informatics ![In: Ecol. Informatics 6(5), pp. 296-302, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
34 | Casper Find Andersen, Graham D. Finlayson |
Estimation of an individual's Human Cone Fundamentals from their Color Matching Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CGIV/MCS ![In: 5th European Conference on Colour in Graphics, Imaging, and Vision and 12th International Symposium on Multispectral Colour Science, CGIV 2010/MCS'10, Joensuu, Finland, June 14-17, 2010, pp. 138-142, 2010, IS&T - The Society for Imaging Science and Technology, 978-0-89208-291-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
34 | Casper Find Andersen |
New results in colour characterization of humans and cameras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2010 |
RDF |
|
34 | Ali Alsam, Casper Find Andersen |
Robust Averaged Projections Onto Convex Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CGIV/MCS ![In: 4th European Conference on Colour in Graphics, Imaging, and Vision and 10th International Symposium on Multispectral Colour Science, CGIV 2008/MCS'08, Terrassa, Spain, June 9-13, 2008, pp. 597-601, 2008, IS&T - The Society for Imaging Science and Technology, 978-1-60560-702-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
34 | Christian Wichmann Matthiessen, Annette Winkel Schwarz, Søren Find |
World cities of knowledge: research strength, networks and nodality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Knowl. Manag. ![In: J. Knowl. Manag. 10(5), pp. 14-25, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Casper Find Andersen, Jon Yngve Hardeberg |
Colorimetric Characterization of Digital Cameras Preserving Hue Planes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIC ![In: 13th Color and Imaging Conference, CIC 2005, Scottsdale, Arizona, USA, November 7-11, 2005, pp. 141-146, 2005, Society for Imaging Science and Technology, 0-89208-259-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Rao Desineni, Leah Pastel, Maroun Kassab, Robert Redburn |
Hard to find, easy to find systematics; just find them. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITC ![In: 2011 IEEE International Test Conference, ITC 2010, Austin, TX, USA, November 2-4, 2010, pp. 388-397, 2010, IEEE Computer Society, 978-1-4244-7206-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
33 | Jimmy Lin, Mark D. Smucker |
How do users find things with PubMed?: towards automatic utility evaluation with user simulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGIR ![In: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2008, Singapore, July 20-24, 2008, pp. 19-26, 2008, ACM, 978-1-60558-164-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
find-similar, related article search |
28 | Kesheng Wu, Ekow J. Otoo, Kenji Suzuki 0001 |
Optimizing two-pass connected-component labeling algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Anal. Appl. ![In: Pattern Anal. Appl. 12(2), pp. 117-135, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Union-find algorithm, Optimization, Decision tree, Equivalence relation, Connected-component labeling |
27 | Michael D. Adams 0001, R. Kent Dybvig |
Efficient nondestructive equality checking for trees and graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, ICFP 2008, Victoria, BC, Canada, September 20-28, 2008, pp. 179-188, 2008, ACM, 978-1-59593-919-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
dfa equivalence, eq hash tables, scheme, equality, union-find |
27 | Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick |
Melding priority queues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(4), pp. 535-556, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
disjoint set union, minimum directed spanning trees, optimum branchings, word RAM model, Priority queues, heaps, union-find |
27 | Arnold Meijster, Michael H. F. Wilkinson |
A Comparison of Algorithms for Connected Set Openings and Closings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 24(4), pp. 484-494, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
connected set operators, attribute filters, pattern spectra, mathematical morphology, multiscale analysis, union-find |
25 | Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick |
Union-Find with Constant Time Deletions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 78-89, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Haim Kaplan, Nira Shafrir, Robert Endre Tarjan |
Meldable heaps and boolean union-find. ![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. 573-582, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Yoshiko Habuchi, Muneo Kitajima, Haruhiko Takeuchi |
Comparison of eye movements in searching for easy-to-find and hard-to-find information in a hierarchically organized information structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ETRA ![In: Proceedings of the Eye Tracking Research & Application Symposium, ETRA 2008, Savannah, Georgia, USA, March 26-28, 2008, pp. 131-134, 2008, ACM, 978-1-59593-982-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hierarchical information structure, latent semantic analysis, web usability, information scent, LSA |
23 | Amir M. Ben-Amram, Zvi Galil |
Lower Bounds for Dynamic Data Structures on Algebraic RAMs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(3), pp. 364-395, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Cell-probe lower bounds, Dynamic prefix sum, Union-find, Random access machine |
23 | Daniel J. Rosenkrantz, Lin Yu, S. S. Ravi |
Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 30(1), pp. 83-100, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Cell-probe lower bounds, Dynamic prefix sum, Union-find, Random access machine |
23 | Adelka Niels, Jutta Fortmann |
Find your way in the UX process jungle: An introduction to UX process models and methods and a practical session on how to find a suitable process for your project. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI Extended Abstracts ![In: Extended Abstracts of the 2023 CHI Conference on Human Factors in Computing Systems, CHI EA 2023, Hamburg, Germany, April 23-28, 2023, pp. 540:1-540:3, 2023, ACM, 978-1-4503-9422-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Cennet Oguz, Pascal Denis, Emmanuel Vincent 0001, Simon Ostermann 0002, Josef van Genabith |
Find-2-Find: Multitask Learning for Anaphora Resolution and Object Localization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMNLP ![In: Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, EMNLP 2023, Singapore, December 6-10, 2023, pp. 8099-8110, 2023, Association for Computational Linguistics, 979-8-89176-060-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Michael Krivelevich |
Expanders - how to find them, and what to find in them. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BCC ![In: Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29 - August 2, 2019., pp. 115-142, 2019, Cambridge University Press, 978-1-108-74072-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Mohammed R. H. Qwaider, Anne-Lyse Minard, Manuela Speranza, Bernardo Magnini |
Find Problems before They Find You with AnnotatorPro's Monitoring Functionalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CLiC-it ![In: Proceedings of the Fourth Italian Conference on Computational Linguistics (CLiC-it 2017), Rome, Italy, December 11-13, 2017., 2017, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
23 | David Carlson |
Why Can't I Find My Data the Way I Find My Dinner? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 25th International Conference on Data Engineering, ICDE 2009, March 29 2009 - April 2 2009, Shanghai, China, pp. 4, 2009, IEEE Computer Society, 978-0-7695-3545-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Gary Marchionini, Ryen White |
Find What You Need, Understand What You Find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Hum. Comput. Interact. ![In: Int. J. Hum. Comput. Interact. 23(3), pp. 205-237, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Jan Heß, Volker Wulf |
Community-orientierte Dienste für digitales interaktives Fernsehen: Das Beispiel der "Find-a-Friend"-Anwendung (Community Based Services for Digital Interactive Television: The "Find-a-Friend" Prototype). ![Search on Bibsonomy](Pics/bibsonomy.png) |
i-com ![In: i-com 5(3), pp. 33-37, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Johannes A. La Poutré |
Lower Bounds for the Union-Find and the Sp;it-Find Problem on Pointer Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 52(1), pp. 87-99, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Johannes A. La Poutré |
Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, USA, pp. 34-44, 1990, ACM, 0-89791-361-2. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
22 | Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi |
On Smoothed Analysis of Quicksort and Hoare's Find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 158-167, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Costantino Grana, Daniele Borghesani, Rita Cucchiara |
Connected Component Labeling Techniques on Modern Architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAP ![In: Image Analysis and Processing - ICIAP 2009, 15th International Conference Vietri sul Mare, Italy, September 8-11, 2009, Proceedings, pp. 816-824, 2009, Springer, 978-3-642-04145-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
comparison, union-find, connected component labeling |
22 | Xiwei Feng, Feng Xue, Tongwei Zhang |
Research on Data Exchange Push Technology Based on Message-driven. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCAI ![In: First IITA International Joint Conference on Artificial Intelligence, Hainan Island, China, 25-26 April 2009, pp. 563-566, 2009, IEEE Computer Society, 978-0-7695-3615-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
recommended find, message-driven, Server Push, publish/ Subscribe, Data Exchange |
22 | Constantine Dovrolis |
What would Darwin think about clean-slate architectures? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Commun. Rev. ![In: Comput. Commun. Rev. 38(1), pp. 29-34, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
FP7-ICT FIRE, NSF FIND, internet, GENI |
22 | Andrzej S. Murawski, C.-H. Luke Ong |
Fast verification of MLL proof nets via IMLL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 7(3), pp. 473-498, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Multiplicative linear logic, disjoint union find, essential nets, dominator trees, proof nets |
22 | Peter Dawyndt, Marc Vancanneyt, Hans E. De Meyer, Jean Swings |
Knowledge Accumulation and Resolution of Data Inconsistencies during the Integration of Microbial Information Sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 17(8), pp. 1111-1126, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
synonymy, error detection/correction, microbiology, Transitive closure, homology, union-find |
22 | Chenyu Wu, Ce Liu 0001, Heung-Yeung Shum, Ying-Qing Xu, Zhengyou Zhang |
Automatic Eyeglasses Removal from Face Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 26(3), pp. 322-336, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Intelligent image editing, find-and-replace, eye region detection, eyeglasses localization, eyeglasses removal |
22 | Bin Xu 0009, Danny Z. Chen, Robert J. Szczerba |
Determining optimal paths in a weighted and dynamic 2D environment using framed-octrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Agents ![In: Proceedings of the Fourth International Conference on Autonomous Agents, AGENTS 2000, Barcelona, Catalonia, Spain, June 3-7, 2000, pp. 29-30, 2000, ACM, 1-58113-230-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
cell decomposition, framed-octrees, union-find structure, computational geometry, path planning, optimal paths |
22 | Marc J. van Kreveld, Mark H. Overmars |
Union-Copy Structures and Dynamic Segment Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 40(3), pp. 635-652, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
union-find structure |
22 | Amir M. Ben-Amram, Zvi Galil |
Lower Bounds for Data Structure Problems on RAMs (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 622-631, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
union-find problem, average case time, data structure problems, output variability, problem variability, unbounded integers, lower bounds, upper bound, RAMs, worst case time |
22 | Neil V. Murray |
Some Observations on Equivalence Handling Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 30(5), pp. 361-362, 1981. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
path compression, tree balancing, partition, Equivalence, UNION-FIND |
20 | Shuo Guo, Ziguo Zhong, Tian He 0001 |
FIND: faulty node detection for wireless sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SenSys ![In: Proceedings of the 7th International Conference on Embedded Networked Sensor Systems, SenSys 2009, Berkeley, California, USA, November 4-6, 2009, pp. 253-266, 2009, ACM, 978-1-60558-519-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
data fault detection, wireless sensor networks |
19 | Robert Law |
Using student blogs for documentation in software development projects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 16th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2011, Darmstadt, Germany, June 27-29, 2011, pp. 366, 2011, ACM, 978-1-4503-0697-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Jacques Patarin |
How to Find and Avoid Collisions for the Knapsack Hash Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '93, Workshop on the Theory and Application of of Cryptographic Techniques, Lofthus, Norway, May 23-27, 1993, Proceedings, pp. 305-317, 1993, Springer, 3-540-57600-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
17 | Esteban García-Cuesta, Inés María Galván, Antonio J. de Castro |
Discriminant Regression Analysis to Find Homogeneous Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDEAL ![In: Intelligent Data Engineering and Automated Learning - IDEAL 2009, 10th International Conference, Burgos, Spain, September 23-26, 2009. Proceedings, pp. 191-199, 2009, Springer, 978-3-642-04393-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
density clustering, dimensionality reduction, LDA, spectral clustering, discriminant models |
17 | Sven Laumer, Andreas Eckhardt |
Help to find the needle in a haystack: integrating recommender systems in an IT supported staff recruitment system. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPR ![In: Proceedings of the 2009 ACM SIGMIS CPR Conference on Computer Personnel Research 2009, May 28-30, 2009, Limerick, Ireland, pp. 7-12, 2009, ACM, 978-1-60558-427-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
it architecture, recommender systems, design science, e-recruiting |
17 | Kazuhiro Suzuki, Kaoru Kurosawa |
How to Find Many Collisions of 3-Pass HAVAL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWSEC ![In: Advances in Information and Computer Security, Second International Workshop on Security, IWSEC 2007, Nara, Japan, October 29-31, 2007, Proceedings, pp. 428-443, 2007, Springer, 978-3-540-75650-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hash function, collision, differential attack, HAVAL |
17 | David Hovemeyer, Jaime Spacco, William W. Pugh |
Evaluating and tuning a static analysis to find null pointer bugs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PASTE ![In: Proceedings of the 2005 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering, PASTE'05, Lisbon, Portugal, September 5-6, 2005, pp. 13-19, 2005, ACM, 1-59593-239-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
testing, static analysis |
17 | Kurt Mehlhorn, Stefan Näher, Helmut Alt |
A Lower Bound for the Complexity of the Union-Split-Find Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings, pp. 479-488, 1987, Springer, 3-540-18088-5. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
15 | Liang Tang, Changjie Tang, Lei Duan, Yexi Jiang, Jie Zuo, Jun Zhu |
SLICE: A Novel Method to Find Local Linear Correlations by Constructing Hyperplanes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb/WAIM ![In: Advances in Data and Web Management, Joint International Conferences, APWeb/WAIM 2009, Suzhou, China, April 2-4, 2009, Proceedings, pp. 635-640, 2009, Springer, 978-3-642-00671-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Linear Correlation, Data Mining, Principal Component Analysis |
15 | Guoqing Xu 0001, Matthew Arnold, Nick Mitchell, Atanas Rountev, Gary Sevitsky |
Go with the flow: profiling copies to find runtime bloat. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2009, Dublin, Ireland, June 15-21, 2009, pp. 419-430, 2009, ACM, 978-1-60558-392-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
copy graph, memory bloat, profiling, heap analysis |
15 | Carlos Lara-Alvarez, Leonardo Romero, Juan J. Flores, Cuauhtemoc Gomez |
A Simple Sample Consensus Algorithm to Find Multiple Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIARP ![In: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 14th Iberoamerican Conference on Pattern Recognition, CIARP 2009, Guadalajara, Jalisco, Mexico, November 15-18, 2009. Proceedings, pp. 918-925, 2009, Springer, 978-3-642-10267-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Myoung Kim, Yoonsik Cheon |
A Fitness Function to Find Feasible Sequences of Method Calls for Evolutionary Testing of Object-Oriented Programs. ![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. 537-540, 2008, IEEE Computer Society, 978-0-7695-3127-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
genetic algorithms, object-oriented programming, test data generator, fitness function, evolutionary testing, pre and postconditions, JML language |
15 | Yihui Liu, Li Bai |
Find Key m/z Values in Predication of Mass Spectrometry Cancer Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (1) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues, 4th International Conference on Intelligent Computing, ICIC 2008, Shanghai, China, September 15-18, 2008, Proceedings, pp. 196-203, 2008, Springer, 978-3-540-87440-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Pingda Shu, Huahui Chen 0001 |
A New Method to Find Top K Items in Data Streams at Arbitrary Time Granularities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSSE (4) ![In: International Conference on Computer Science and Software Engineering, CSSE 2008, Volume 4: Embedded Programming / Database Technology / Neural Networks and Applications / Other Applications, December 12-14, 2008, Wuhan, China, pp. 267-270, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Chun-Hung Lu, Chih-Chien Wang, Min-Yuh Day, Chorng-Shyong Ong, Wen-Lian Hsu |
Using "Cited by" Information to Find the Context of Research Papers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISI Workshops ![In: Intelligence and Security Informatics, IEEE ISI 2008 International Workshops: PAISI, PACCF, and SOCO 2008, Taipei, Taiwan, June 17, 2008. Proceedings, pp. 343-354, 2008, Springer, 978-3-540-69136-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Automatic meta-analysis, Human factors, Link mining |
15 | Yasusi Sinohara, Atsuhiro Takasu |
Support Kernel Machine-Based Active Learning to Find Labels and a Proper Kernel Simultaneously. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDEAL ![In: Intelligent Data Engineering and Automated Learning - IDEAL 2007, 8th International Conference, Birmingham, UK, December 16-19, 2007, Proceedings, pp. 277-286, 2007, Springer, 978-3-540-77225-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Thom W. Frühwirth |
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSCLP ![In: Recent Advances in Constraints, 12th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2007, Rocquencourt, France, June 7-8, 2007, Revised Selected Papers, pp. 91-108, 2007, Springer, 978-3-540-89811-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Kristof Beyls, Erik H. D'Hollander |
Intermediately executed code is the key to find refactorings that improve temporal data locality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Conf. Computing Frontiers ![In: Proceedings of the Third Conference on Computing Frontiers, 2006, Ischia, Italy, May 3-5, 2006, pp. 373-382, 2006, ACM, 1-59593-302-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
performance debugger, temporal data locality, program analysis, refactoring, program optimizations, loop transformations |
15 | Byung Ryong Kim, Ki-Chang Kim |
A Proposal of Extension of FMS-Based Mechanism to Find Attack Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part III, pp. 476-485, 2006, Springer, 3-540-34075-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Qingzhang Chen, Jianghong Han, Wenxiu He, Yungang Lai |
Utilize Fuzzy Data Mining to Find the Travel Pattern of Browsers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIT ![In: Fifth International Conference on Computer and Information Technology (CIT 2005), 21-23 September 2005, Shanghai, China, pp. 228-232, 2005, IEEE Computer Society, 0-7695-2432-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Maximum Forward Reference, Data Mining, Fuzzy set theory |
15 | Sandip Debnath, C. Lee Giles |
A learning based model for headline extraction of news articles to find explanatory sentences for events. ![Search on Bibsonomy](Pics/bibsonomy.png) |
K-CAP ![In: Proceedings of the 3rd International Conference on Knowledge Capture (K-CAP 2005), October 2-5, 2005, Banff, Alberta, Canada, pp. 189-190, 2005, ACM, 1-59593-163-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
explanatory sentence, news metadata, metadata extraction |
15 | Yusuke Hayashi, Mitsuru Ikeda |
Intellectual Reputation to Find an Appropriate Person for a Role in Creation and Inheritance of Organizational Intellect. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Intelligent Tutoring Systems ![In: Intelligent Tutoring Systems, 7th International Conference, ITS 2004, Maceiò, Alagoas, Brazil, August 30 - September 3, 2004, Proceedings, pp. 273-284, 2004, Springer, 3-540-22948-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | René Arnulfo García-Hernández, José Francisco Martínez Trinidad, Jesús Ariel Carrasco-Ochoa |
A Fast Algorithm to Find All the Maximal Frequent Sequences in a Text. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIARP ![In: Progress in Pattern Recognition, Image Analysis and Applications, 9th Iberoamerican Congress on Pattern Recognition, CIARP 2004, Puebla, Mexico, October 26-29, 2004, Proceedings, pp. 478-486, 2004, Springer, 3-540-23527-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Kwang-Su Yang, Ruixin Yang, Jiang Tang, Menas Kafatos |
An Efficient Method to Find Area Clusters with Constraints Using Grid Index Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSDBM ![In: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), 21-23 June 2004, Santorini Island, Greece, pp. 433-434, 2004, IEEE Computer Society, 0-7695-2146-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | John Russell |
Find what I mean: exploring new kinds of search results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGDOC ![In: Proceedings of the 20st annual international conference on Documentation, SIGDOC 2002, Toronto, Ontario, Canada, October 20-23, 2002, pp. 179-185, 2002, ACM, 1-58113-543-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
search, navigation, hierarchy, web interfaces, books, online information |
15 | Ye-In Chang, Yu-Ming Hsieh |
SETM*-MaxK: An Efficient SET-Based Approach to Find the Largest Itemset. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 6th Pacific-Asia Conference, PAKDD 2002, Taipei, Taiwan, May 6-8, 2002, Proceedings, pp. 316-321, 2002, Springer, 3-540-43704-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa |
A Practical Algorithm to Find the Best Subsequence Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, Third International Conference, DS 2000, Kyoto, Japan, December 4-6, 2000, Proceedings, pp. 141-154, 2000, Springer, 3-540-41352-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Sayaka Nagai, Shin-Ichi Nakano |
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar 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. 290-301, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Koh Hosoda, Minoru Asada |
How Does a Robot Find Redundancy by Itself? ![Search on Bibsonomy](Pics/bibsonomy.png) |
EWLR ![In: Advances in Robot Learning, 8th European Workshop on Learning Robots, EWLR-8, Lausanne, Switzerland, September 18, 1999, Proceedings, pp. 61-70, 1999, Springer, 3-540-41162-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 30179 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|