Sciweavers

2215 search results - page 184 / 443
» Wide open spaces
Sort
View
ICSE
2012
IEEE-ACM
13 years 7 months ago
Where should the bugs be fixed? More accurate information retrieval-based bug localization based on bug reports
—For a large and evolving software system, the project team could receive a large number of bug reports. Locating the source code files that need to be changed in order to fix th...
Jian Zhou, Hongyu Zhang, David Lo
IJCNN
2007
IEEE
15 years 11 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot
ALGORITHMICA
2007
86views more  ALGORITHMICA 2007»
15 years 4 months ago
Detecting Holes and Antiholes in Graphs
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
Stavros D. Nikolopoulos, Leonidas Palios
CORR
2011
Springer
223views Education» more  CORR 2011»
14 years 11 months ago
Decentralized Formation Control Part I: Geometric Aspects
In this paper, we develop new methods for the analysis of decentralized control systems and we apply them to formation control problems. The basic set-up consists of a system with...
Mohamed-Ali Belabbas
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
16 years 4 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...