Sciweavers

724 search results - page 48 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
16 years 6 days ago
Practical learning from one-sided feedback
In many data mining applications, online labeling feedback is only available for examples which were predicted to belong to the positive class. Such applications include spam filt...
D. Sculley
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
15 years 3 months ago
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
Michal Meyerovitch
ICETET
2009
IEEE
15 years 6 months ago
Best Fit Void Filling Algorithm in Optical Burst Switching Networks
: Optical Burst Switching is a promising technology in Optical Network. Scheduling of data burst in data channels in an optimal way is one of a key problem in Optical Burst Switche...
M. Nandi, Ashok K. Turuk, D. K. Puthal, S. Dutta
77
Voted
JIIS
2006
124views more  JIIS 2006»
14 years 11 months ago
An efficient approach to mining indirect associations
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
Qian Wan, Aijun An
GLVLSI
2003
IEEE
146views VLSI» more  GLVLSI 2003»
15 years 5 months ago
A practical CAD technique for reducing power/ground noise in DSM circuits
One of the fundamental problems in Deep Sub Micron (DSM) circuits is Simultaneous Switching Noise (SSN), which causes voltage fluctuations in the circuit power/ground networks. In...
Arindam Mukherjee, Krishna Reddy Dusety, Rajsaktis...