Sciweavers

2600 search results - page 435 / 520
» Clustering with or without the Approximation
Sort
View
IBPRIA
2003
Springer
14 years 2 months ago
A Colour Tracking Procedure for Low-Cost Face Desktop Applications
In this paper we present an environment for the tracking of a human face obtained from a real video sequence. We will describe the system and discuss the advantages and disadvanta...
Francisco J. Perales López, Ramon Mas, Miqu...
PODS
2010
ACM
232views Database» more  PODS 2010»
14 years 2 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
ISPD
2000
ACM
131views Hardware» more  ISPD 2000»
14 years 1 months ago
Multi-center congestion estimation and minimization during placement
As technology advances, more and more issues need to be considered in the placement stage, e.g., wirelength, congestion, timing, coupling. It is very hard to consider all of them ...
Maogang Wang, Xiaojian Yang, Kenneth Eguro, Majid ...
SIGMOD
1998
ACM
142views Database» more  SIGMOD 1998»
14 years 1 months ago
Dimensionality Reduction for Similarity Searching in Dynamic Databases
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimens...
Kothuri Venkata Ravi Kanth, Divyakant Agrawal, Amb...
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
14 years 24 days ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam