Sciweavers

3547 search results - page 167 / 710
» Computers Seeing People
Sort
View
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
15 years 10 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody
HICSS
2007
IEEE
108views Biometrics» more  HICSS 2007»
15 years 10 months ago
Perceived Benefits and Concerns of Prospective Users of the SmartCampus Location-Aware Community System Test-bed
The SmartCampus initiative aims to turn an urban university campus into a living laboratory for location aware community system services. To lay a foundation for this effort, the ...
Eunhee Kim, Maria Plummer, Starr Roxanne Hiltz, Qu...
GD
2005
Springer
15 years 9 months ago
Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...
ISORC
2003
IEEE
15 years 9 months ago
Embedded Linux Outlook in the PostPC Industry
This paper presents an analysis of the future of Embedded Linux in the PostPC industry. This analysis is carried out by first examining the current forces at work in the PostPC ma...
Seongsoo Hong
LACL
1998
Springer
15 years 8 months ago
Strict Compositionality and Literal Movement Grammars
Abstract. The principle of compositionality, as standardly defined, regards grammars as compositional that are not compositional in an intuitive sense of the word. There is, for ex...
Marcus Kracht