Sciweavers

2477 search results - page 461 / 496
» Approximate extended formulations
Sort
View
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
13 years 11 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
ESANN
2006
13 years 11 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...
WSC
2000
13 years 11 months ago
Circumstance descriptors: a method for generating plan modifications and fragmentary orders
Circumstance Descriptors are offered as a way to organize spatial and other military knowledge that may be difficult to formulate, particularly the kinds of details that are most ...
John B. Gilmer Jr.
APSEC
2007
IEEE
14 years 4 months ago
Incentive Compatible Mechanisms for Group Ticket Allocation in Software Maintenance Services
A customer reported problem (or Trouble Ticket) in software maintenance is typically solved by one or more maintenance engineers. The decision of allocating the ticket to one or m...
Karthik Subbian, Ramakrishnan Kannan, Raghav Kumar...
ADHOC
2007
122views more  ADHOC 2007»
13 years 10 months ago
Minimum latency joint scheduling and routing in wireless sensor networks
Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient ...
Gang Lu, Bhaskar Krishnamachari