3146 search results - page 48 / 630 » Efficient Consequence Finding |
103
Voted
COMBINATORICS
2006
15 years 17 days 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...
137
Voted
COMGEO
2006
ACM
15 years 17 days 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...
87
Voted
TC
2008
15 years 13 days 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...
121
Voted
MOBISYS
2005
ACM
16 years 3 days 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 ...
89
Voted
COLT
2008
Springer
15 years 2 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...