563 search results - page 86 / 113 » Computing approximate PSD factorizations |
109
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
92
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
138
Voted
MOBIHOC
2005
ACM
16 years 1 months ago
2005
ACM
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
103
click to vote
COCOON
2007
Springer
15 years 8 months ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
124
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...