Sciweavers

10848 search results - page 325 / 2170
» Programming in Biomolecular Computation
Sort
View
EDM
2008
93views Data Mining» more  EDM 2008»
15 years 8 months ago
A Preliminary Analysis of the Logged Questions that Students Ask in Introductory Computer Science
Asking questions is widely believed to contribute to student learning, but little is known about the questions that students ask or how to exploit them in tutorial interventions to...
Cecily Heiner
AAAI
2006
15 years 8 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
ICMLA
2003
15 years 8 months ago
Robust Support Vector Machines for Anomaly Detection in Computer Security
— Using the 1998 DARPA BSM data set collected at MIT’s Lincoln Labs to study intrusion detection systems, the performance of robust support vector machines (RVSMs) was compared...
Wenjie Hu, Yihua Liao, V. Rao Vemuri
DSS
2006
95views more  DSS 2006»
15 years 6 months ago
On the computability of agent-based workflows
Workflow research is commonly concerned with optimization, modeling, and dependency. In this research, we however address a more fundamental issue. By modeling humans and machines...
Wai Yin Mok, Prashant Palvia, David Paper
180
Voted
COMPLEXITY
2007
104views more  COMPLEXITY 2007»
15 years 6 months ago
What is the complexity of a distributed computing system?
Distributed computing systems are becoming bigger and more complex. While the complexity of large-scale distributed systems has been acknowledged to be an important challenge, the...
Anand Ranganathan, Roy H. Campbell