Sciweavers

818 search results - page 148 / 164
» Network bargaining: algorithms and structural results
Sort
View
DATE
2000
IEEE
124views Hardware» more  DATE 2000»
14 years 4 days ago
On the Generation of Multiplexer Circuits for Pass Transistor Logic
Pass Transistor Logic has attracted more and more interest during last years, since it has proved to be an attractive alternative to static CMOS designs with respect to area, perf...
Christoph Scholl, Bernd Becker
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
13 years 11 months ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...
CSCLP
2006
Springer
13 years 11 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
TOG
2002
141views more  TOG 2002»
13 years 7 months ago
Geometry images
Surface geometry is often modeled with irregular triangle meshes. The process of remeshing refers to approximating such geometry using a mesh with (semi)-regular connectivity, whi...
Xianfeng Gu, Steven J. Gortler, Hugues Hoppe
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
13 years 5 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...