Sciweavers

2063 search results - page 172 / 413
» connection 2007
Sort
View
146
Voted
ICSOC
2007
Springer
15 years 10 months ago
Let It Flow: Building Mashups with Data Processing Pipelines
Mashups are a new kind of interactive Web application, built out of the composition of two or more existing Web service APIs and data sources. Whereas “pure” mashups are built ...
Biörn Biörnstad, Cesare Pautasso
161
Voted
IPSN
2007
Springer
15 years 10 months ago
Wireless localization using self-organizing maps
Localization is an essential service for many wireless sensor network applications. While several localization schemes rely on anchor nodes and range measurements to achieve fine...
Gianni Giorgetti, Sandeep K. S. Gupta, Gianfranco ...
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
15 years 10 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
ISVC
2007
Springer
15 years 10 months ago
Unsynchronized 4D Barcodes
Abstract. We present a novel technique for optical data transfer between public displays and mobile devices based on unsynchronized 4D barcodes. We assume that no direct (electroma...
Tobias Langlotz, Oliver Bimber
LFCS
2007
Springer
15 years 10 months ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang