Sciweavers

450 search results - page 89 / 90
» Estimating Search Tree Size
Sort
View
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 5 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
CVPR
2010
IEEE
14 years 1 months ago
Curious Snakes: a minimum-latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embe...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony Yez...
MICRO
2008
IEEE
138views Hardware» more  MICRO 2008»
13 years 11 months ago
Hybrid analytical modeling of pending cache hits, data prefetching, and MSHRs
As the number of transistors integrated on a chip continues to increase, a growing challenge is accurately modeling performance in the early stages of processor design. Analytical...
Xi E. Chen, Tor M. Aamodt
MICRO
2006
IEEE
127views Hardware» more  MICRO 2006»
13 years 11 months ago
A Predictive Performance Model for Superscalar Processors
Designing and optimizing high performance microprocessors is an increasingly difficult task due to the size and complexity of the processor design space, high cost of detailed si...
P. J. Joseph, Kapil Vaswani, Matthew J. Thazhuthav...
DASFAA
2004
IEEE
86views Database» more  DASFAA 2004»
13 years 9 months ago
Supporting Exploratory Queries in Databases
Users of database applications, especially in the e-commerce domain, often resort to exploratory "trial-and-error" queries since the underlying data space is huge and unf...
Abhijit Kadlag, Amol V. Wanjari, Juliana Freire, J...