Sciweavers

1952 search results - page 104 / 391
» Complete partitions of graphs
Sort
View
CASES
2001
ACM
15 years 8 months ago
Computation offloading to save energy on handheld devices: a partition scheme
We consider handheld computing devices which are connected to a server (or a powerful desktop machine) via a wireless LAN. On such devices, it is often possible to save the energy...
Zhiyuan Li, Cheng Wang, Rong Xu
JSYML
2010
107views more  JSYML 2010»
15 years 2 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
WWW
2008
ACM
16 years 5 months ago
Graph theoretical framework for simultaneously integrating visual and textual features for efficient web image clustering
With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering...
Manjeet Rege, Ming Dong, Jing Hua
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
15 years 4 months ago
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
János Barát, Jirí Matousek, D...
ICLP
2009
Springer
16 years 4 months ago
Incremental Answer Completion in the SLG-WAM
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
Alexandre Miguel Pinto, Luís Moniz Pereira,...