Sciweavers

6251 search results - page 989 / 1251
» Randomness, Computability, and Density
Sort
View
ERSHOV
2009
Springer
15 years 11 months ago
Indexing Dense Nested Metric Spaces for Efficient Similarity Search
Abstract. Searching in metric spaces is a very active field since it offers methods for indexing and searching by similarity in collections of unstructured data. These methods sele...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
EUROPAR
2009
Springer
15 years 11 months ago
A Buffer Space Optimal Solution for Re-establishing the Packet Order in a MPSoC Network Processor
We consider a multi-processor system-on-chip destined for streaming applications. An application is composed of one input and one output queue and in-between, several levels of ide...
Daniela Genius, Alix Munier Kordon, Khouloud Zine ...
HIPC
2007
Springer
15 years 11 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
FOCS
2009
IEEE
15 years 11 months ago
Optimal Quantum Strong Coin Flipping
Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit [Blu81]. Quantum information allows for ...
André Chailloux, Iordanis Kerenidis
BROADNETS
2004
IEEE
15 years 11 months ago
Routing in Ad Hoc Networks-A Wireless Perspective
Traditionally, the routing problem is addressed at the network layer, an approach that has been extended to the wireless realm. In wireless multihop networks, however, strict laye...
Martin Haenggi