Sciweavers

322 search results - page 34 / 65
» On the Complexity of Reverse Similarity Search
Sort
View
IPPS
2006
IEEE
14 years 2 months ago
Reducing reconfiguration time of reconfigurable computing systems in integrated temporal partitioning and physical design framew
In reconfigurable systems, reconfiguration latency is a very important factor impact the system performance. In this paper, a framework is proposed that integrates the temporal pa...
Farhad Mehdipour, Morteza Saheb Zamani, H. R. Ahma...
CIKM
2008
Springer
13 years 10 months ago
Learning latent semantic relations from clickthrough data for query suggestion
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu
ECCV
2002
Springer
14 years 10 months ago
A Stochastic Algorithm for 3D Scene Segmentation and Reconstruction
In this paper, we present a stochastic algorithm by effective Markov chain Monte Carlo (MCMC) for segmenting and reconstructing 3D scenes. The objective is to segment a range image...
Feng Han, Zhuowen Tu, Song Chun Zhu
ICDE
2007
IEEE
137views Database» more  ICDE 2007»
14 years 10 months ago
ProVeR: Probabilistic Video Retrieval using the Gauss-Tree
Modeling objects by probability density functions (pdf) is a new powerful method to represent complex objects in databases. By representing an object as a pdf, e.g. a Gaussian, it...
Alexey Pryakhin, Christian Böhm, Matthias Sch...
ISW
2009
Springer
14 years 3 months ago
On Free-Start Collisions and Collisions for TIB3
In this paper, we present free-start collisions for the TIB3 hash function with a complexity of about 232 compression function evaluations. By using message modification technique...
Florian Mendel, Martin Schläffer