2354 search results - page 167 / 471 » A Common-Sense Theory of Time |
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
LATA
2009
Springer
14 years 3 months ago
2009
Springer
We study the effects of faulty data on NP-hard sets. We consider hard sets for several polynomial time reductions, add corrupt data and then analyze whether the resulting sets are...
CSEE
2009
Springer
14 years 2 months ago
2009
Springer
This paper describes an application of a Game Development Framework (GDF) Microsoft XNA in software architecture (SA) course at Norwegian University of Science and Technology (NTN...
ISVD
2007
IEEE
14 years 2 months ago
2007
IEEE
We introduce the use of weighted medial graph structures to represent sounds and musical events. Such structures permit the building of hierarchical neighborhood relationships (sy...