Sciweavers

9736 search results - page 1946 / 1948
» How Fast Can We Compute Products
Sort
View
BMCBI
2006
100views more  BMCBI 2006»
15 years 4 months ago
DNPTrapper: an assembly editing tool for finishing and analysis of complex repeat regions
Background: Many genome projects are left unfinished due to complex, repeated regions. Finishing is the most time consuming step in sequencing and current finishing tools are not ...
Erik Arner, Martti T. Tammi, Anh-Nhi Tran, Ellen K...
EC
2006
163views ECommerce» more  EC 2006»
15 years 4 months ago
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
Boris Mitavskiy, Jonathan E. Rowe
133
Voted
TC
1998
15 years 4 months ago
Algorithms for Variable Length Subnet Address Assignment
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
Mikhail J. Atallah, Douglas Comer
163
Voted
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
15 years 2 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
SADFE
2010
IEEE
15 years 2 months ago
Fonts for Forensics
: Like other latent evidence that cannot be directly perceived by people, bit sequences have to be presented through tools. Presentations of digital forensic evidence often involve...
Fred Cohen
« Prev « First page 1946 / 1948 Last » Next »