Sciweavers

169 search results - page 22 / 34
» Counting paths in digraphs
Sort
View
SMA
2003
ACM
118views Solid Modeling» more  SMA 2003»
14 years 1 months ago
Graph based topological analysis of tessellated surfaces
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
Tula Ram Ban, Dibakar Sen
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 8 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor
DT
2002
67views more  DT 2002»
13 years 8 months ago
A Retargetable Embedded In-Circuit Emulation Module for Microprocessors
This article presents an in-circuit emulation (ICE) module that can be embedded with a microprocessr core. The ICE module, based on the IEEE 1149.1 JTAG architecture, supports typ...
Ing-Jer Huang, Chung-Fu Kao, Hsin-Ming Chen, Ching...
ICC
2008
IEEE
141views Communications» more  ICC 2008»
14 years 3 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
ASPLOS
2011
ACM
13 years 5 days ago
S2E: a platform for in-vivo multi-path analysis of software systems
This paper presents S2E, a platform for analyzing the properties and behavior of software systems. We demonstrate S2E’s use in developing practical tools for comprehensive perfo...
Vitaly Chipounov, Volodymyr Kuznetsov, George Cand...