16626 search results - page 207 / 3326 » Computing is a natural science |
189
click to vote
TCS
2010
15 years 5 months ago
2010
In this work we provide a combinatorial analysis of bucket recursive trees, which have been introduced previously as a natural generalization of the growth model of recursive trees...
172
click to vote
DLT
2009
15 years 4 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
161
click to vote
ACSC
2009
IEEE
16 years 1 months ago
2009
IEEE
Itemsets, which are treated as intermediate results in association mining, have attracted significant research due to the inherent complexity of their generation. However, there ...
156
click to vote
FOCS
2005
IEEE
16 years 7 days ago
2005
IEEE
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...
181
click to vote
GI
2003
Springer
15 years 12 months ago
2003
Springer
: Natural Language is not appropriate for reference models because it risks being an in-complete, unstructured and inconsistent form of representation. This paper presents insights...