Sciweavers

2372 search results - page 336 / 475
» Probabilistic calling context
Sort
View
IPSN
2010
Springer
14 years 2 months ago
Slotted programming for sensor networks
We advocate a novel programming approach we call slotted programming that not only addresses the specific hardware capabilities of sensor nodes, but also facilitates coding throu...
Roland Flury, Roger Wattenhofer
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
14 years 2 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
CVPR
2009
IEEE
14 years 2 months ago
Contextualizing histogram
In this paper, we investigate how to incorporate spatial and/or temporal contextual information into classical histogram features with the aim of boosting visual classification p...
Bingbing Ni, Shuicheng Yan, Ashraf A. Kassim
DASFAA
2009
IEEE
96views Database» more  DASFAA 2009»
14 years 2 months ago
Materialized View Selection in XML Databases
Materialized views, a rdbms silver bullet, demonstrate its efficacy in many applications, especially as a data warehousing/decison support system tool. The pivot of playing materia...
Nan Tang, Jeffrey Xu Yu, Hao Tang, M. Tamer Ö...
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
14 years 2 months ago
Efficient Private Record Linkage
— Record linkage is the computation of the associations among records of multiple databases. It arises in contexts like the integration of such databases, online interactions and...
Mohamed Yakout, Mikhail J. Atallah, Ahmed K. Elmag...