Sciweavers

2680 search results - page 105 / 536
» The topology of the independence complex
Sort
View
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
15 years 7 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
IJCBDD
2010
127views more  IJCBDD 2010»
14 years 11 months ago
Predicting protein complexes by data integration of different types of interactions
: The explosion of highthroughput interaction data from proteomics studies gives us the opportunity to integrate Protein-Protein Interactions (PPI) from different type of interacti...
Powell Patrick Cheng Tan, Daryanaz Dargahi, Freder...
PVLDB
2010
166views more  PVLDB 2010»
14 years 11 months ago
Complex Event Detection at Wire Speed with FPGAs
Complex event detection is an advanced form of data stream processing where the stream(s) are scrutinized to identify given event patterns. The challenge for many complex event pr...
Louis Woods, Jens Teubner, Gustavo Alonso
113
Voted
ESEM
2010
ACM
14 years 11 months ago
Introducing the evaluation of complexity in functional size measurement: a UML-based approach
Functional Size Measures are often used for effort estimation. However, these measures do not take into account the amount and complexity of elaboration required, concentrating in...
Luigi Lavazza, Gabriela Robiolo
SMA
2005
ACM
167views Solid Modeling» more  SMA 2005»
15 years 6 months ago
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
Peter Hachenberger, Lutz Kettner