Sciweavers

2735 search results - page 293 / 547
» Comparing notions of randomness
Sort
View
92
Voted
IJCV
2008
266views more  IJCV 2008»
15 years 20 days ago
Learning to Recognize Objects with Little Supervision
This paper shows (i) improvements over state-of-the-art local feature recognition systems, (ii) how to formulate principled models for automatic local feature selection in object c...
Peter Carbonetto, Gyuri Dorkó, Cordelia Sch...
98
Voted
FUIN
2006
139views more  FUIN 2006»
15 years 20 days ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
92
Voted
IJOE
2006
75views more  IJOE 2006»
15 years 19 days ago
Comparison of Intensive and Extensive Sensor Networking Technologies
The objective of this paper is to emphasize a clear and natural distinction in strategies of sensor network design. In order to display different architectural paradigms in today&#...
Marek Miskowicz
CORR
2007
Springer
74views Education» more  CORR 2007»
15 years 19 days ago
Computing Minimal Polynomials of Matrices
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
Max Neunhöffer, Cheryl E. Praeger
120
Voted
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 19 days ago
Dependable k-coverage algorithms for sensor networks
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
Simon Gyula, Miklós Molnár, Lá...