Sciweavers

5100 search results - page 116 / 1020
» The Linear Complexity of a Graph
Sort
View
TIT
2008
78views more  TIT 2008»
13 years 9 months ago
New Binary Sequences With Optimal Autocorrelation Magnitude
New binary sequences of period
Nam Yul Yu, Guang Gong
CIB
2005
125views more  CIB 2005»
13 years 9 months ago
An On-Line Web Visualization System with Filtering and Clustering Graph
A Web graph refers to the graph that is used to represent relationships between Web pages in cyberspace, where a node represents a URL and an edge indicates a link between two URLs...
Wei Lai, Xiaodi Huang, Ronald Wibowo, Jiro Tanaka
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 3 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
DCOSS
2008
Springer
13 years 11 months ago
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
Animesh Pathak, Viktor K. Prasanna
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 4 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux