Sciweavers

409 search results - page 75 / 82
» Odd Crossing Number and Crossing Number Are Not the Same
Sort
View
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
14 years 7 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
RECOMB
2008
Springer
14 years 7 months ago
Accurate Computation of Likelihoods in the Coalescent with Recombination Via Parsimony
Understanding the variation of recombination rates across a given genome is crucial for disease gene mapping and for detecting signatures of selection, to name just a couple of app...
Jotun Hein, Rune B. Lyngsø, Yun S. Song
ICSE
2008
IEEE-ACM
14 years 7 months ago
Proposing SQL statement coverage metrics
An increasing number of cyber attacks are occurring at the application layer when attackers use malicious input. These input validation vulnerabilities can be exploited by (among ...
Ben H. Smith, Yonghee Shin, Laurie Williams
EWSN
2008
Springer
14 years 7 months ago
Radio Characterization of 802.15.4 and Its Impact on the Design of Mobile Sensor Networks
Future mobile sensing systems are being designed using 802.15.4 low-power short-range radios for a diverse set of devices from embedded mobile motes to sensor-enabled cellphones in...
Emiliano Miluzzo, Xiao Zheng, Kristof Fodor, Andre...
FOCS
2009
IEEE
14 years 2 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi