1729 search results - page 91 / 346 » Deterministic Expressions in C |
111
click to vote
ENTCS
2002
15 years 4 months ago
2002
If S = 0 is a system of n equations and unknowns over C and S() = 0 to what extent can we compute with the point ? In particular, can we decide whether or not a polynomial express...
124
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
In this paper, we will examine the frequent pattern mining for uncertain data sets. We will show how the broad classes of algorithms can be extended to the uncertain data setting....
135
click to vote
MOBIHOC
2006
ACM
16 years 4 months ago
2006
ACM
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...
132
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
133
click to vote
ESCIENCE
2007
IEEE
15 years 11 months ago
2007
IEEE
Future Grid Networks should be able to provide Quality of Service (QoS) guarantees to their users. In this work we propose a framework for Grid Networks that provides deterministi...