Sciweavers

4377 search results - page 715 / 876
» Mass problems and randomness
Sort
View
146
Voted
CIKM
2004
Springer
15 years 10 months ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
ECCV
2004
Springer
15 years 10 months ago
Robust Encoding of Local Ordinal Measures: A General Framework of Iris Recognition
Abstract. The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and various sources of intra-class ...
Zhenan Sun, Tieniu Tan, Yunhong Wang
EGPGV
2004
Springer
165views Visualization» more  EGPGV 2004»
15 years 10 months ago
Tuning of Algorithms for Independent Task Placement in the Context of Demand-Driven Parallel Ray Tracing
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
Tomas Plachetka
EUROCRYPT
2004
Springer
15 years 10 months ago
Concurrent Signatures
We introduce the concept of concurrent signatures. These allow two entities to produce two signatures in such a way that, from the point of view of any third party, both signatures...
Liqun Chen, Caroline Kudla, Kenneth G. Paterson
GD
2004
Springer
15 years 10 months ago
Drawing Power Law Graphs
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Reid Andersen, Fan R. K. Chung, Lincoln Lu