Sciweavers

1023 search results - page 172 / 205
» A Formal Method for Program Slicing
Sort
View
WWW
2005
ACM
16 years 2 months ago
CaTTS: calendar types and constraints for Web applications
Data referring to cultural calendars such as the widespread Gregorian dates but also dates after the Chinese, Hebrew, or Islamic calendars as well as data referring to professiona...
François Bry, Frank-André Rieß...
AI
2009
Springer
15 years 8 months ago
An Ontology-Based Spatial Clustering Selection System
Spatial clustering, which groups similar spatial objects into classes, is an important research topic in spatial data mining. Many spatial clustering methods have been developed re...
Wei Gu, Xin Wang, Danielle Ziébelin
AIME
2005
Springer
15 years 7 months ago
Learning Rules from Multisource Data for Cardiac Monitoring
This paper aims at formalizing the concept of learning rules from multisource data in a cardiac monitoring context. Our method has been implemented and evaluated on learning from d...
Élisa Fromont, Rene Quiniou, Marie-Odile Co...
ICPPW
2002
IEEE
15 years 6 months ago
A Statistical Approach for the Analysis of the Relation Between Low-Level Performance Information, the Code, and the Environment
This paper presents a methodology for aiding a scientific programmer to evaluate the performance of parallel programs on advanced architectures. It applies well-defined design o...
Nayda G. Santiago, Diane T. Rover, Domingo Rodr&ia...
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 5 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan