Sciweavers

1859 search results - page 82 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
IFIP12
2008
15 years 6 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda
CIDR
2009
157views Algorithms» more  CIDR 2009»
15 years 6 months ago
SCADS: Scale-Independent Storage for Social Computing Applications
Collaborative web applications such as Facebook, Flickr and Yelp present new challenges for storing and querying large amounts of data. As users and developers are focused more on...
Michael Armbrust, Armando Fox, David A. Patterson,...
JMM2
2006
111views more  JMM2 2006»
15 years 4 months ago
A Microscopic Telepathology System for Multiresolution Computer-Aided Diagnostics
The aim of the presented system is simplification and speedup of the daily pathological examination routine. The system combines telepathology with computer-aided diagnostics algor...
Grigory Begelman, Michael Pechuk, Ehud Rivlin, Edm...
ICML
2009
IEEE
16 years 5 months ago
Robot trajectory optimization using approximate inference
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
Marc Toussaint
ICML
1995
IEEE
16 years 5 months ago
Learning to Make Rent-to-Buy Decisions with Systems Applications
In the single rent-to-buy decision problem, without a priori knowledge of the amount of time a resource will be used we need to decide when to buy the resource, given that we can ...
P. Krishnan, Philip M. Long, Jeffrey Scott Vitter