Sciweavers

692 search results - page 9 / 139
» BDD minimization for approximate computing
Sort
View
COLING
2010
14 years 7 months ago
Fast, Greedy Model Minimization for Unsupervised Tagging
Model minimization has been shown to work well for the task of unsupervised part-of-speech tagging with a dictionary. In (Ravi and Knight, 2009), the authors invoke an integer pro...
Sujith Ravi, Ashish Vaswani, Kevin Knight, David C...
BIRTHDAY
2009
Springer
15 years 4 months ago
Minimizing Average Flow-Time
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg
FOCS
2007
IEEE
15 years 4 months ago
Minimizing Average Flow-time : Upper and Lower Bounds
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg, Amit Kumar
INFOCOM
2012
IEEE
13 years 2 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 2 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar