Sciweavers

1960 search results - page 235 / 392
» The Logic of Large Enough
Sort
View
ADBIS
2001
Springer
107views Database» more  ADBIS 2001»
14 years 2 months ago
The Impact of Buffering on Closest Pairs Queries Using R-Trees
In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are...
Antonio Corral, Michael Vassilakopoulos, Yannis Ma...
ICS
2010
Tsinghua U.
14 years 1 months ago
Clustering performance data efficiently at massive scales
Existing supercomputers have hundreds of thousands of processor cores, and future systems may have hundreds of millions. Developers need detailed performance measurements to tune ...
Todd Gamblin, Bronis R. de Supinski, Martin Schulz...
AAAI
2008
14 years 29 days ago
A Fast Data Collection and Augmentation Procedure for Object Recognition
When building an application that requires object class recognition, having enough data to learn from is critical for good performance, and can easily determine the success or fai...
Benjamin Sapp, Ashutosh Saxena, Andrew Y. Ng
CP
2008
Springer
14 years 13 days ago
An Application of Constraint Programming to Superblock Instruction Scheduling
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...
Abid M. Malik, Michael Chase, Tyrel Russell, Peter...
DAGSTUHL
2006
14 years 1 days ago
Cognitive Vision Needs Attention to Link Sensing with Recognition
Abstract. "Cognitive computer vision is concerned with integration and control of vision systems using explicit but not necessarily symbolic models of context, situation and g...
John K. Tsotsos