Sciweavers

6095 search results - page 804 / 1219
» Learning in Local Search
Sort
View
WWW
2007
ACM
16 years 7 months ago
Designing efficient sampling techniques to detect webpage updates
Due to resource constraints, Web archiving systems and search engines usually have difficulties keeping the entire local repository synchronized with the Web. We advance the state...
Qingzhao Tan, Ziming Zhuang, Prasenjit Mitra, C. L...
PODS
2006
ACM
216views Database» more  PODS 2006»
16 years 7 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
CVPR
2010
IEEE
16 years 2 months ago
The Cluttered Background Problem for Active Contours: A Minimum-Latency Solution
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Stefano Soatto, Ganesh Sundaramoorthi, Anthony Yez...
DATE
2009
IEEE
118views Hardware» more  DATE 2009»
16 years 1 months ago
Gate sizing for large cell-based designs
—Today, many chips are designed with predefined discrete cell libraries. In this paper we present a new fast gate sizing algorithm that works natively with discrete cell choices...
Stephan Held
ICST
2009
IEEE
16 years 1 months ago
A Simple Coverage-Based Locator for Multiple Faults
Fault localization helps spotting faults in source code by exploiting automatically collected data. Deviating from other fault locators relying on hit spectra or test coverage inf...
Friedrich Steimann, Mario Bertschler