Sciweavers

475 search results - page 15 / 95
» Z3-Connectivity with Independent Number 2
Sort
View
FOCS
2009
IEEE
14 years 4 months ago
Choice-Memory Tradeoff in Allocations
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich
IWPEC
2009
Springer
14 years 4 months ago
Boolean-Width of Graphs
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
ALGOSENSORS
2009
Springer
13 years 7 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
13 years 9 months ago
A Note on the Expected Time for Finding Maxima by List Algorithms
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
Luc Devroye
IESS
2007
Springer
124views Hardware» more  IESS 2007»
14 years 4 months ago
Integrated Coupling and Clock Frequency Assignment of Accelerators During Hardware/Software Partitioning
: Hardware/software partitioning moves software kernels from a microprocessor to custom hardware accelerators. We consider advanced implementation options for accelerators, greatly...
Scott Sirowy, Frank Vahid