432 search results - page 47 / 87 » Open Problems with Part-Whole Relations |
127
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
We make two main contributions in this paper. First, we motivate and introduce a novel class of data mining problems that arise in labeling a group of mass spectra, specifically f...
140
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
125
click to vote
DSN
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the following problem for wireless ad hoc networks: assume n nodes, each capable of communicating with nodes within a radius of r, are distributed in a ddimensional re...
142
click to vote
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
132
click to vote
IOR
2010
15 years 2 months ago
2010
In many applications involving make-to-order or time-sensitive (e.g., perishable, seasonal) products, finished orders are often delivered to customers immediately or shortly after...