Sciweavers

1541 search results - page 280 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
CP
2007
Springer
13 years 12 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
DAC
2010
ACM
13 years 11 months ago
On the costs and benefits of stochasticity in stream processing
With the end of clock-frequency scaling, parallelism has emerged as the key driver of chip-performance growth. Yet, several factors undermine efficient simultaneous use of onchip ...
Raj R. Nadakuditi, Igor L. Markov
CVPR
2010
IEEE
13 years 10 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
AUSDM
2008
Springer
237views Data Mining» more  AUSDM 2008»
13 years 10 months ago
On Inconsistencies in Quantifying Strength of Community Structures
Complex network analysis involves the study of the properties of various real world networks. In this broad field, research on community structures forms an important sub area. Th...
Wen Haw Chong
CLEF
2008
Springer
13 years 9 months ago
UniNE at Domain-Specific IR - CLEF 2008
Our first objective in participating in this domain-specific evaluation campaign is to propose and evaluate various indexing and search strategies for the German, English and Russ...
Claire Fautsch, Ljiljana Dolamic, Jacques Savoy