Sciweavers

29908 search results - page 222 / 5982
» On the complexity of communication complexity
Sort
View
WIA
2004
Springer
15 years 12 months ago
On the Complexity of Hopcroft's State Minimization Algorithm
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
Jean Berstel, Olivier Carton
CEC
2003
IEEE
15 years 12 months ago
MEH: modular evolvable hardware for designing complex circuits
Evolvable hardware adjusts oneself to changeable environments by self-organizing the circuit. Due to its high productivity and creativity for designing circuit, it is widely invest...
Jin-Hyuk Hong, Sung-Bae Cho
VLDB
1997
ACM
132views Database» more  VLDB 1997»
15 years 10 months ago
GTE SuperPages: Using IR Techniques for Searching Complex Objects
The yellow pagesservice of GTE SuperPages enables Web users to flexibly search through liitings of 11 million businessesin over 17000 categories. To achievethe flexibility desired...
Steven D. Whitehead, Himanshu Sinha, Michael Murph...
ASAP
2004
IEEE
99views Hardware» more  ASAP 2004»
15 years 10 months ago
Complex Square Root with Operand Prescaling
We propose a radix-r digit-recurrence algorithm for complex square-root. The operand is prescaled to allow the selection of square-root digits by rounding of the residual. This lea...
Milos D. Ercegovac, Jean-Michel Muller
BPM
2006
Springer
206views Business» more  BPM 2006»
15 years 10 months ago
A Discourse on Complexity of Process Models
Complexity has undesirable effects on, among others, the correctness, maintainability, and understandability of business process models. Yet, measuring complexity of business proce...
Jorge Cardoso, Jan Mendling, Gustaf Neumann, Hajo ...