Sciweavers

3305 search results - page 187 / 661
» Can we Rely on SQL
Sort
View
CPM
2001
Springer
108views Combinatorics» more  CPM 2001»
14 years 3 months ago
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
Anne Bergeron
ISCC
2000
IEEE
14 years 3 months ago
The Use of Software Agents as Proxies
Today information can be accessed from the Internet using a variety of devices and via different types of networks. With such diversity, it is impossible for a server on the Inter...
Binh Thai, Aruna Seneviratne
WETICE
2000
IEEE
14 years 3 months ago
Towards Secure e-Services
This poster paper presents a work in progress in the new emerging area of electronic services (e-services). The networked home with refrigerators and washing machines connected to...
Claudiu Duma, Almut Herzog, Nahid Shahmehri
ACMDIS
2000
ACM
14 years 3 months ago
Touch Me, Hit Me and I Know How You Feel: A Design Approach to Emotionally Rich Interaction
In this paper we propose a 3-step method for designing emotionally rich interactions, illustrated by the design of an alarm clock. By emotionally rich interaction we understand in...
Stephan Wensveen, Kees Overbeeke, J. P. Djajadinin...
ISMIS
1999
Springer
14 years 3 months ago
Machine Learning Method for Software Quality Model Building
Software quality prediction can be cast as a concept learning problem. In this paper, we discuss the full cycle of an application of Machine Learning to software quality predictio...
Mauricio Amaral de Almeida, Stan Matwin