3146 search results - page 48 / 630 » Efficient Consequence Finding |
COMBINATORICS
2006
13 years 10 months ago
2006
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always poss...
COMGEO
2006
ACM
13 years 10 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
TC
2008
13 years 10 months ago
2008
In this paper, the problem of finding good wordlength combinations for fixed-point digital signal processing flowgraphs is addressed. By formulating and solving an approximate opti...
MOBISYS
2005
ACM
14 years 9 months ago
2005
ACM
Recently, there has been an increasing interest in wireless broadcast systems as a means to enable scalable content delivery to large numbers of mobile users. However, gracefully ...
COLT
2008
Springer
13 years 11 months ago
2008
Springer
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...