Sciweavers

657 search results - page 131 / 132
» Polynomial Time Algorithms for Minimum Energy Scheduling
Sort
View
SIGECOM
2005
ACM
169views ECommerce» more  SIGECOM 2005»
13 years 11 months ago
Online auctions with re-usable goods
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mo...
MOBIQUITOUS
2007
IEEE
14 years 16 days ago
Optimal Relay Node Fault Recovery
—Topology control problems are concerned with the assignment of power levels to the nodes of an ad-hoc network so as to maintain a specified network topology while minimizing th...
Fei Che, Liang Zhao, Errol L. Lloyd
DCOSS
2006
Springer
13 years 10 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
TASLP
2011
13 years 1 months ago
A Probabilistic Interaction Model for Multipitch Tracking With Factorial Hidden Markov Models
—We present a simple and efficient feature modeling approach for tracking the pitch of two simultaneously active speakers. We model the spectrogram features of single speakers u...
Michael Wohlmayr, Michael Stark, Franz Pernkopf
CGF
2006
191views more  CGF 2006»
13 years 6 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt