Sciweavers

10457 search results - page 1434 / 2092
» Data Mapping as Search
Sort
View
SODA
1993
ACM
118views Algorithms» more  SODA 1993»
15 years 8 months ago
Scapegoat Trees
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
Igal Galperin, Ronald L. Rivest
CSE
2009
IEEE
15 years 8 months ago
Social Relationship Identification: An Example of Social Query
Every moment, millions of people worldwide are communicating and sharing content online. We express ourselves online to enrich existing relationships and establish new relationship...
Christopher P. Diehl, Jaime Montemayor, Michael Pe...
202
Voted
GECCO
2008
Springer
116views Optimization» more  GECCO 2008»
15 years 8 months ago
Evolving similarity functions for code plagiarism detection
Students are often asked to submit electronic copies of their program code as part of assessment in computer science courses. To counter code plagiarism, educational institutions ...
Victor Ciesielski, Nelson Wu, Seyed M. M. Tahaghog...
GECCO
2008
Springer
115views Optimization» more  GECCO 2008»
15 years 8 months ago
A genetic programming approach to business process mining
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
Chris J. Turner, Ashutosh Tiwari, Jörn Mehnen
ICMCS
2010
IEEE
178views Multimedia» more  ICMCS 2010»
15 years 8 months ago
Optimal configuration of hash table based multimedia fingerprint databases using weak bits
The increasingly large amount of digital multimedia content has created a need for technologies to search and identify multimedia files. Multimedia fingerprinting has been widely ...
Claus Bauer, Regunathan Radhakrishnan, Wenyu Jiang
« Prev « First page 1434 / 2092 Last » Next »