Sciweavers

405 search results - page 30 / 81
» The True Cost of Accurate Time
Sort
View
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
15 years 11 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
WWW
2008
ACM
15 years 10 months ago
Recrawl scheduling based on information longevity
It is crucial for a web crawler to distinguish between ephemeral and persistent content. Ephemeral content (e.g., quote of the day) is usually not worth crawling, because by the t...
Christopher Olston, Sandeep Pandey
ISCAS
2005
IEEE
133views Hardware» more  ISCAS 2005»
15 years 3 months ago
Multiobjective VLSI cell placement using distributed simulated evolution algorithm
— Simulated Evolution (SimE) is a sound stochastic approximation algorithm based on the principles of adaptation. If properly engineered it is possible for SimE to reach nearopti...
Sadiq M. Sait, Ali Mustafa Zaidi, Mustafa I. Ali
PROMS
2001
Springer
92views Multimedia» more  PROMS 2001»
15 years 2 months ago
Providing VCR Functionality in Staggered Video Broadcasting
A true video-on-demand(TVOD) system lets users view any video program, at any time, and perform any VCR functions, but its peruser video delivery cost is too expensive. A near vide...
Jin B. Kwon, Heon Young Yeom
AAAI
2008
15 years 11 days ago
A General Method for Reducing the Complexity of Relational Inference and its Application to MCMC
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
Hoifung Poon, Pedro Domingos, Marc Sumner