Sciweavers

540 search results - page 66 / 108
» Competitive Routing over Time
Sort
View
CPM
2010
Springer
175views Combinatorics» more  CPM 2010»
14 years 3 months ago
Compression, Indexing, and Retrieval for Massive String Data
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
AIPS
2004
13 years 11 months ago
Price Prediction Strategies for Market-Based Scheduling
In a market-based scheduling mechanism, the allocation of time-specific resources to tasks is governed by a competitive bidding process. Agents bidding for multiple, separately al...
Jeffrey K. MacKie-Mason, Anna Osepayshvili, Daniel...
ICC
2000
IEEE
376views Communications» more  ICC 2000»
14 years 2 months ago
TCP-Bus: Improving TCP Performance in Wireless Ad-Hoc Networks
Abstract: Reliable data transmission over wireless multi-hop networks, called ad hoc networks, has proven to be non-trivial. TCP (Transmission Control Protocol), a widely used end-...
Dongkyun Kim, Chai-Keong Toh, Yanghee Choi
ETT
2002
128views Education» more  ETT 2002»
13 years 10 months ago
Geographical and temporal characteristics of inter-POP flows: View from a single pop
In this paper, we study traffic demands in an IP bacbkone, identify the routes used by these demands, and evaluate traffic granularity levels that are attractive for improving the...
Supratik Bhattacharyya, Christophe Diot, Nina Taft...
CVPR
2008
IEEE
15 years 5 days ago
Beyond sliding windows: Object localization by efficient subwindow search
Most successful object recognition systems rely on binary classification, deciding only if an object is present or not, but not providing information on the actual object location...
Christoph H. Lampert, Matthew B. Blaschko, Thomas ...