Sciweavers

11328 search results - page 2034 / 2266
» Timed Branching Processes
Sort
View
CVPR
2009
IEEE
15 years 10 months ago
Optimal scanning for faster object detection
Recent years have seen the development of fast and accurate algorithms for detecting objects in images. However, as the size of the scene grows, so do the running-times of these a...
Nicholas J. Butko, Javier R. Movellan
116
Voted
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 10 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
WWW
2009
ACM
15 years 10 months ago
Building term suggestion relational graphs from collective intelligence
This paper proposes an effective approach to provide relevant search terms for conceptual Web search. ‘Semantic Term Suggestion’ function has been included so that users can f...
Jyh-Ren Shieh, Yung-Huan Hsieh, Yang-Ting Yeh, Tse...
GIS
2009
ACM
15 years 10 months ago
Constrained reverse nearest neighbor search on mobile objects
In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query c...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
HIPEAC
2009
Springer
15 years 10 months ago
Hybrid Super/Subthreshold Design of a Low Power Scalable-Throughput FFT Architecture
In this article, we present a parallel implementation of a 1024 point Fast Fourier Transform (FFT) operating with a subthreshold supply voltage, which is below the voltage that tur...
Michael B. Henry, Leyla Nazhandali
« Prev « First page 2034 / 2266 Last » Next »