Sciweavers

473 search results - page 69 / 95
» Cache-Conscious Structure Layout
Sort
View
GBRPR
2007
Springer
14 years 1 months ago
Approximating TSP Solution by MST Based Graph Pyramid
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
Yll Haxhimusa, Walter G. Kropatsch, Zygmunt Pizlo,...
ICDM
2006
IEEE
164views Data Mining» more  ICDM 2006»
14 years 1 months ago
Unsupervised Learning of Tree Alignment Models for Information Extraction
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
Philip Zigoris, Damian Eads, Yi Zhang
INFOVIS
2005
IEEE
14 years 1 months ago
Vizster: Visualizing Online Social Networks
Recent years have witnessed the dramatic popularity of online social networking services, in which millions of members publicly articulate mutual "friendship" relations....
Jeffrey Heer, Danah Boyd
UML
2004
Springer
14 years 25 days ago
Modeling Business Processes in Web Applications with ArgoUWE
Abstract. The CASE tool ArgoUWE supports the systematic design of Web applications using the UML-based Web Engineering (UWE) approach. The design methodology of UWE is based on a m...
Alexander Knapp, Nora Koch, Gefei Zhang, Hanns-Mar...
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
14 years 24 days ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston