Sciweavers

8647 search results - page 357 / 1730
» The Container Selection Problem
Sort
View
156
Voted
ICML
2002
IEEE
16 years 5 months ago
Learning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...
NLDB
2007
Springer
15 years 10 months ago
Treatment of Passive Voice and Conjunctions in Use Case Documents
Abstract. Requirements engineering, the first phase of any software development project, is the Achilles’ heel of the whole development process, as requirements documents are of...
Leonid Kof
142
Voted
KBSE
2006
IEEE
15 years 10 months ago
Detecting Precedence-Related Advice Interference
Aspect-Oriented Programming (AOP) has been proposed in literature to overcome modularization shortcomings such as the tyranny of the dominant decomposition. However, the new langu...
Maximilian Storzer, Florian Forster
150
Voted
IWDC
2005
Springer
156views Communications» more  IWDC 2005»
15 years 10 months ago
Labeling Schemes for Tree Representation
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, A...
MLDM
2005
Springer
15 years 10 months ago
Multivariate Discretization by Recursive Supervised Bipartition of Graph
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
Sylvain Ferrandiz, Marc Boullé