Sciweavers

7303 search results - page 1262 / 1461
» Optimality for dynamic patterns
Sort
View
152
Voted
ICFP
2002
ACM
16 years 3 months ago
A demand-driven adaptive type analysis
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
Danny Dubé, Marc Feeley
130
Voted
MOBIHOC
2006
ACM
16 years 3 months ago
Data storage placement in sensor networks
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...
Bo Sheng, Qun Li, Weizhen Mao
99
Voted
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
16 years 27 days ago
A Space--Time Tradeoff for Permutation Problems
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
Mikko Koivisto, Pekka Parviainen
143
Voted
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
16 years 27 days ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
150
Voted
ICDCS
2009
IEEE
16 years 20 days ago
ISP Friend or Foe? Making P2P Live Streaming ISP-Aware
Abstract: Current peer-to-peer systems are network-agnostic, often generating large volumes of unnecessary inter-ISP traffic. Although recent work has shown the benefits of ISP-a...
Fabio Picconi, Laurent Massoulié
« Prev « First page 1262 / 1461 Last » Next »