Sciweavers

149 search results - page 17 / 30
» Crossing Numbers and Parameterized Complexity
Sort
View
GRID
2000
Springer
13 years 11 months ago
An Advanced User Interface Approach for Complex Parameter Study Process Specification on the Information Power Grid
The creation of parameter study suites has recently become a more challenging problem as the parameter studies have become multi-tiered and the computational environment has becom...
Maurice Yarrow, Karen M. McCann, Rupak Biswas, Rob...
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
14 years 8 months ago
Camouflaged fraud detection in domains with complex relationships
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
Sankar Virdhagriswaran, Gordon Dakin
BMCBI
2007
115views more  BMCBI 2007»
13 years 7 months ago
Recognizing protein-protein interfaces with empirical potentials and reduced amino acid alphabets
Background: In structural genomics, an important goal is the detection and classification of protein–protein interactions, given the structures of the interacting partners. We h...
Guillaume Launay, Raul Mendez, Shoshana J. Wodak, ...
SIGGRAPH
2000
ACM
13 years 11 months ago
Accessible animation and customizable graphics via simplicial configuration modeling
Our goal is to embed free-form constraints into a graphical model. With such constraints a graphic can maintain its visual integrity--and break rules tastefully--while being manip...
Tom Ngo, Doug Cutrell, Jenny Dana, Bruce Randall D...
LATA
2009
Springer
14 years 2 months ago
Automata on Gauss Words
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
Alexei Lisitsa, Igor Potapov, Rafiq Saleh