Sciweavers

17920 search results - page 325 / 3584
» Recentering computer science
Sort
View
WG
2007
Springer
16 years 24 days ago
Characterization and Recognition of Digraphs of Bounded Kelly-width
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...
Daniel Meister, Jan Arne Telle, Martin Vatshelle
ACSC
2006
IEEE
16 years 23 days ago
Approximative filtering of XML documents in a publish/subscribe system
Publish/subscribe systems filter published documents and inform their subscribers about documents matching their interests. Recent systems have focussed on documents or messages ...
Annika Hinze, Yann Michel, Torsten Schlieder
ACMSE
2006
ACM
16 years 20 days ago
A SAT-based solver for Q-ALL SAT
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
Ben Browning, Anja Remshagen
177
Voted
ACMSE
2005
ACM
16 years 7 days ago
Bibliometric approach to community discovery
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
Narsingh Deo, Hemant Balakrishnan
STACS
2005
Springer
16 years 5 days ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt