Sciweavers

953 search results - page 80 / 191
» A note on the paper
Sort
View
JCT
2010
79views more  JCT 2010»
13 years 6 months ago
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
Maciej Kalkowski, Michal Karonski, Florian Pfender
TCS
2010
13 years 6 months ago
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
Katerina Asdre, Stavros D. Nikolopoulos
BMCBI
2010
106views more  BMCBI 2010»
13 years 2 months ago
Identification and correction of previously unreported spatial phenomena using raw Illumina BeadArray data
Background: A key stage for all microarray analyses is the extraction of feature-intensities from an image. If this step goes wrong, then subsequent preprocessing and processing s...
Mike L. Smith, Mark J. Dunning, Simon Tavaré...
CHI
2006
ACM
14 years 8 months ago
ButterflyNet: a mobile capture and access system for field biology research
Through a study of field biology practices, we observed that biology fieldwork generates a wealth of heterogeneous information, requiring substantial labor to coordinate and disti...
Ron B. Yeh, Chunyuan Liao, Scott R. Klemmer, Fran&...
ICDM
2003
IEEE
98views Data Mining» more  ICDM 2003»
14 years 1 months ago
On the Privacy Preserving Properties of Random Data Perturbation Techniques
Privacy is becoming an increasingly important issue in many data mining applications. This has triggered the development of many privacy-preserving data mining techniques. A large...
Hillol Kargupta, Souptik Datta, Qi Wang, Krishnamo...