147 search results - page 10 / 30 » The Computational Complexity of Quantified Reciprocals |
CSL
1999
Springer
15 years 1 months ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
173
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
BMCBI
2011
14 years 4 months ago
2011
Background: Since its inception, proteomics has essentially operated in a discovery mode with the goal of identifying and quantifying the maximal number of proteins in a sample. I...
CJ
2010
14 years 9 months ago
2010
How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present prac...
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...