Sciweavers

2877 search results - page 86 / 576
» The Complexity of Planarity Testing
Sort
View
GECCO
2005
Springer
121views Optimization» more  GECCO 2005»
15 years 11 months ago
New evolutionary techniques for test-program generation for complex microprocessor cores
Checking if microprocessor cores are fully functional at the end of the productive process has become a major issue. Traditional functional approaches are not sufficient when cons...
Ernesto Sánchez, Massimiliano Schillaci, Ma...
ISMAR
2003
IEEE
15 years 10 months ago
Using Augmented Reality for Visualizing Complex Graphs in Three Dimensions
In this paper we explore the effect of using Augmented Reality for three-dimensional graph link analysis. Two experiments were conducted. The first was designed to compare a tangi...
Daniel Belcher, Mark Billinghurst, Sean Hayes, Ran...
DCC
1999
IEEE
15 years 9 months ago
Complexity-Distortion Tradeoffs in Vector Matching Based on Probabilistic Partial Distance Techniques
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...
Krisda Lengwehasatit, Antonio Ortega
176
Voted
ANTS
2010
Springer
260views Algorithms» more  ANTS 2010»
15 years 9 months ago
On the Complexity of the Montes Ideal Factorization Algorithm
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
David Ford, Olga Veres
164
Voted
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 9 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge