2503 search results - page 116 / 501 » A study of 3-arc graphs |
155
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
132
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Dataspace applications necessitate the creation of associations among data items over time. For example, once information about people is extracted from sources on the Web, associa...
144
click to vote
DCC
2002
IEEE
16 years 5 months ago
2002
IEEE
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...
157
click to vote
INFOCOM
2009
IEEE
16 years 25 days ago
2009
IEEE
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
160
click to vote
LICS
2009
IEEE
16 years 25 days ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...