Sciweavers

1921 search results - page 9 / 385
» Stereo Without Search
Sort
View
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
14 years 7 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
IPTPS
2005
Springer
14 years 25 days ago
Quickly Routing Searches Without Having to Move Content
A great deal of work has been done to improve peerto-peer routing by strategically moving or replicating content. However, there are many applications for which a peer-to-peer arc...
Brian F. Cooper
ICMI
2010
Springer
183views Biometrics» more  ICMI 2010»
13 years 5 months ago
The Ambient Spotlight: personal multimodal search without query
The Ambient Spotlight is a prototype system based on personal meeting capture using a laptop and a portable microphone array. The system automatically recognises and structures th...
Jonathan Kilgour, Jean Carletta, Steve Renals
ISAAC
2009
Springer
83views Algorithms» more  ISAAC 2009»
14 years 1 months ago
Deletion without Rebalancing in Multiway Search Trees
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
Siddhartha Sen, Robert Endre Tarjan
ICDE
2001
IEEE
186views Database» more  ICDE 2001»
14 years 8 months ago
Similarity Search without Tears: The OMNI Family of All-purpose Access Methods
Roberto F. Santos Filho, Agma J. M. Traina, Caetan...