Sciweavers

6279 search results - page 1115 / 1256
» Studies in Solution Sampling
Sort
View
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
15 years 4 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim
INFOCOM
2006
IEEE
15 years 4 months ago
Generalized Proportional Fair Scheduling in Third Generation Wireless Data Networks
—In 3G data networks, network operators would like to balance system throughput while serving users in a fair manner. This is achieved using the notion of proportional fairness. ...
Tian Bu, L. Li, Ramachandran Ramjee
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
15 years 4 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
WIOPT
2006
IEEE
15 years 4 months ago
Scheduling sensor activity for point information coverage in wireless sensor networks
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan, Wei...
3DGIS
2006
Springer
15 years 4 months ago
3D Navigation for 3D-GIS - Initial Requirements
The needs for three-dimensional (3D) visualization and navigation within 3D-GIS environment are growing and expanding rapidly in a variety of fields. In a steady shift from tradit...
Ivin Amri Musliman, Alias Abdul-Rahman, Volker Coo...
« Prev « First page 1115 / 1256 Last » Next »