Sciweavers

6455 search results - page 1203 / 1291
» Research problems
Sort
View
AI
2005
Springer
14 years 3 months ago
Instance Cloning Local Naive Bayes
The instance-based k-nearest neighbor algorithm (KNN)[1] is an effective classification model. Its classification is simply based on a vote within the neighborhood, consisting o...
Liangxiao Jiang, Harry Zhang, Jiang Su
APN
2005
Springer
14 years 3 months ago
The ProM Framework: A New Era in Process Mining Tool Support
Under the umbrella of buzzwords such as “Business Activity Monitoring” (BAM) and “Business Process Intelligence” (BPI) both academic (e.g., EMiT, Little Thumb, InWoLvE, Pro...
Boudewijn F. van Dongen, Ana Karla A. de Medeiros,...
CEEMAS
2005
Springer
14 years 3 months ago
MAS Meta-models on Test: UML vs. OPM in the SODA Case Study
In the AOSE (Agent-Oriented Software Engineering) area, several research efforts are underway to develop appropriate meta-models for agent-oriented methodologies. Meta-models are ...
Ambra Molesini, Enrico Denti, Andrea Omicini
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
14 years 3 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 3 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
« Prev « First page 1203 / 1291 Last » Next »