Sciweavers

2106 search results - page 285 / 422
» Specifying C concepts
Sort
View
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 9 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
ESWS
2009
Springer
14 years 4 months ago
An Ontology of Resources: Solving the Identity Crisis
The primary goal of the Semantic Web is to use URIs as a universal space to name anything, expanding from using URIs for webpages to URIs for “real objects and imaginary concepts...
Harry Halpin, Valentina Presutti
MOBIWAC
2009
ACM
14 years 4 months ago
Protocol design and analysis of a HIP-based per-application mobility management platform
Rapid evolution of wireless networking has provided wide-scale of different wireless access technologies like Bluetooth, ZigBee, 802.11a/b/g, DSRC, 3G UMTS, LTE, WiMAX, etc. The c...
László Bokor, László T...
NOCS
2008
IEEE
14 years 4 months ago
Network Simplicity for Latency Insensitive Cores
In this paper we examine a latency insensitive network composed of very fast and simple circuits that connects SoC cores that are also latency insensitive, de-synchronized, or asy...
Daniel Gebhardt, JunBok You, W. Scott Lee, Kenneth...
DSVIS
2003
Springer
14 years 3 months ago
An Approach to Develop User Interfaces with Plasticity
This paper provides an approach to develop user interfaces where plasticity is considered by using several concepts, concretely our proposal is a pattern-based, component-oriented ...
Francisco Montero, Víctor López-Jaqu...