Sciweavers

5100 search results - page 222 / 1020
» The Linear Complexity of a Graph
Sort
View
134
Voted
CGF
2010
168views more  CGF 2010»
15 years 21 days ago
Modeling Complex Unfoliaged Trees from a Sparse Set of Images
We present a novel image-based technique for modeling complex unfoliaged trees. Existing tree modeling tools either require capturing a large number of views for dense 3D reconstr...
Luis D. Lopez, Yuanyuan Ding, Jingyi Yu
98
Voted
ELPUB
2007
ACM
15 years 4 months ago
Designing Metadata Surrogates for Search Result Interfaces of Learning Object Repositories: Linear versus Clustered Metadata Des
This study reports the findings of a usability test conducted to examine users' interaction with two different learning object metadata-driven search result interfaces. The f...
Panos Balatsoukas, Anne Morris, Ann O'Brien
98
Voted
DATE
2003
IEEE
104views Hardware» more  DATE 2003»
15 years 5 months ago
Symbolic Analysis of Nonlinear Analog Circuits
A new method is presented to model symbolically strongly nonlinear circuits, characterized by Piece-Wise Linear (PWL) functions. The method follows the idea of Bokhoven and Leenae...
Alicia Manthe, Zhao Li, C.-J. Richard Shi, Kartike...
88
Voted
GECCO
2008
Springer
119views Optimization» more  GECCO 2008»
15 years 1 months ago
Evolutionary synthesis of low-sensitivity equalizers using adjacency matrix representation
An evolutionary synthesis method to design low-sensitivity IIR filters with linear phase in the passband is presented. The method uses a chromosome coding scheme based on the grap...
Leonardo Bruno de Sá, Antonio Carneiro Mesq...
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 2 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell