Sciweavers

16404 search results - page 890 / 3281
» A set coverage problem
Sort
View
CORR
2006
Springer
122views Education» more  CORR 2006»
15 years 7 months ago
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
Frank Neven, Thomas Schwentick
IJIS
2008
83views more  IJIS 2008»
15 years 7 months ago
An algorithm for modelling key terms
The ability to analyse and represent formally semantic relations of terms is a core issue in information retrieval (IR), natural language processing (NLP), and in many related are...
D. Cai, C. J. van Rijsbergen
IJPRAI
2006
114views more  IJPRAI 2006»
15 years 7 months ago
Selective Voting - Getting More for Less in Sensor Fusion
Many real life problems are characterized by the structure of data derived from multiple sensors. The sensors may be independent, yet their information considers the same entities...
Lior Rokach, Oded Maimon, Reuven Arbel
CORR
2007
Springer
101views Education» more  CORR 2007»
15 years 7 months ago
Variable-Rate Distributed Source Coding in the Presence of Byzantine Sensors
— The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown number of sensors have been reprogrammed by a...
Oliver Kosut, Lang Tong
JGO
2008
111views more  JGO 2008»
15 years 7 months ago
A geometric framework for nonconvex optimization duality using augmented lagrangian functions
We provide a unifying geometric framework for the analysis of general classes of duality schemes and penalty methods for nonconvex constrained optimization problems. We present a ...
Angelia Nedic, Asuman E. Ozdaglar