Sciweavers

2463 search results - page 107 / 493
» Rankings of Directed Graphs
Sort
View
IPM
2008
100views more  IPM 2008»
13 years 9 months ago
Query-level loss functions for information retrieval
Many machine learning technologies such as support vector machines, boosting, and neural networks have been applied to the ranking problem in information retrieval. However, since...
Tao Qin, Xu-Dong Zhang, Ming-Feng Tsai, De-Sheng W...
FSTTCS
2001
Springer
14 years 1 months ago
The Directed Minimum-Degree Spanning Tree Problem
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
Radha Krishnan, Balaji Raghavachari
EWHCI
1995
14 years 24 days ago
Generating Editors for Direct Manipulation of Diagrams
Diagrams (e.g., trees for hierarchical structures, or graphs for finite state machines) are often needed as part of advanced user interfaces, and are frequently specific to a use...
Gerhard Viehstaedt, Mark Minas
VL
1995
IEEE
158views Visual Languages» more  VL 1995»
14 years 23 days ago
DiaGen: A Generator for Diagram Editors Providing Direct Manipulation and Execution of Diagrams
Diagrams (e.g., flowcharts, trees for hierarchical structures, or graphs for finite state machines) are often needed as part of visual language systems and advanced user interfa...
Mark Minas, Gerhard Viehstaedt
ACMICEC
2006
ACM
148views ECommerce» more  ACMICEC 2006»
14 years 3 months ago
Web based information for product ranking in e-business: a fuzzy approach
In this paper we have introduced a methodology to rank the available products in the Internet market. These rankings are based on the customers’ own preferences and also on the ...
B. K. Mohanty, K. Passi