Sciweavers

439 search results - page 85 / 88
» An Improved Analysis of Linear Mergers
Sort
View
ICALP
2004
Springer
15 years 3 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
78
Voted
KDD
1994
ACM
117views Data Mining» more  KDD 1994»
15 years 2 months ago
Application of the TETRAD II Program to the Study of Student Retention in U.S. Colleges
We applied TETRAD II, a causal discovery program developed in Carnegie Mellon University's Department of Philosophy, to a database containing information on 204 U.S. colleges...
Marek J. Druzdze, Clark Glymour
107
Voted
ACSAC
2007
IEEE
15 years 2 months ago
Efficient Detection of Delay-Constrained Relay Nodes
Relay nodes are a potential threat to networks since they are used in many malicious situations like stepping stone attacks, botnet communication, peer-to-peer streaming etc. Quic...
Baris Coskun, Nasir D. Memon
76
Voted
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
14 years 11 months ago
Boosting Optimal Logical Patterns Using Noisy Data
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
Noam Goldberg, Chung-chieh Shan
85
Voted
SIP
2003
14 years 11 months ago
Polyphase Antialiasing in Enlargements
Changing resolution of images is a common operation. It is also common to use simple, i.e., small interpolation kernels satisfying some ”smoothness” qualities that are determi...
Daniel Seidner