146 search results - page 17 / 30 » Computably Enumerable Sets and Quasi-Reducibility |
122
Voted
SETN
2010
Springer
15 years 4 months ago
2010
Springer
The optimal sizing of a small autonomous hybrid power system can be a very challenging task, due to the large number of design settings and the uncertainty in key parameters. This ...
117
Voted
EUROGP
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...
103
Voted
GIS
2006
ACM
15 years 19 days ago
2006
ACM
Geospatial data is often used to predict or recommend movements of robots, people, or animals ("walkers"). Analysis of such systems can be combinatorially explosive. Eac...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a notion of flip which transforms a pseudoline arrangement with contact...
127
click to vote
KDD
2004
ACM
16 years 1 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...