Sciweavers

2612 search results - page 161 / 523
» Switching Graphs and Their Complexity
Sort
View
INTEGRATION
2008
89views more  INTEGRATION 2008»
15 years 25 days ago
Exact ESCT minimization for functions of up to six input variables
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...
WEBDB
2004
Springer
191views Database» more  WEBDB 2004»
15 years 6 months ago
Visualizing and Discovering Web Navigational Patterns
Web site structures are complex to analyze. Cross-referencing the web structure with navigational behaviour adds to the complexity of the analysis. However, this convoluted analys...
Jiyang Chen, Lisheng Sun, Osmar R. Zaïane, Ra...
122
Voted
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 1 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
208
Voted
SIGMOD
2006
ACM
194views Database» more  SIGMOD 2006»
16 years 29 days ago
Graph-based synopses for relational selectivity estimation
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
Joshua Spiegel, Neoklis Polyzotis
CP
2006
Springer
15 years 4 months ago
Constraint Satisfaction with Bounded Treewidth Revisited
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
Marko Samer, Stefan Szeider