Sciweavers

4208 search results - page 709 / 842
» Challenges in Evaluating Distributed Algorithms
Sort
View
EOR
2010
88views more  EOR 2010»
15 years 1 months ago
Mathematical programming approaches for generating p-efficient points
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
Miguel A. Lejeune, Nilay Noyan
135
Voted
JSAC
2008
140views more  JSAC 2008»
15 years 1 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
TIT
2008
83views more  TIT 2008»
15 years 1 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
VLDB
2002
ACM
116views Database» more  VLDB 2002»
15 years 1 months ago
Watermarking Relational Databases
We enunciate the need for watermarking database relations to deter their piracy, identify the unique characteristics of relational data which pose new challenges for watermarking,...
Rakesh Agrawal, Jerry Kiernan
CORR
2010
Springer
193views Education» more  CORR 2010»
15 years 5 days ago
A Probabilistic Approach for Learning Folksonomies from Structured Data
Learning structured representations has emerged as an important problem in many domains, including document and Web data mining, bioinformatics, and image analysis. One approach t...
Anon Plangprasopchok, Kristina Lerman, Lise Getoor