Sciweavers

3288 search results - page 620 / 658
» Feed-links for network extensions
Sort
View
KDD
2009
ACM
203views Data Mining» more  KDD 2009»
16 years 2 months ago
Characterizing individual communication patterns
The increasing availability of electronic communication data, such as that arising from e-mail exchange, presents social and information scientists with new possibilities for char...
R. Dean Malmgren, Jake M. Hofman, Luis A. N. Amara...
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
16 years 2 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
POPL
2003
ACM
16 years 2 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
16 years 2 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
16 years 2 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour